./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5a3d22d49117f02662b197492bc1b16616a2878 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:57,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:57,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:57,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:57,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:57,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:57,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:57,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:57,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:57,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:57,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:57,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:57,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:57,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:57,825 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:57,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:57,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:57,827 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:57,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:57,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:57,830 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:57,831 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:57,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:57,833 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:57,833 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:57,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:57,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:57,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:57,835 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:57,836 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:57,836 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:57,837 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:57,837 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:57,837 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:57,838 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:57,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:57,838 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 08:34:57,848 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:57,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:57,849 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 08:34:57,849 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 08:34:57,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:57,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:57,850 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:57,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:57,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:34:57,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:57,851 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:57,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 08:34:57,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:57,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:57,852 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:34:57,852 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:34:57,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:57,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:57,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:34:57,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 08:34:57,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:57,853 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:34:57,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 08:34:57,853 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-18 08:34:57,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:57,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:57,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:57,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:57,888 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:57,888 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 08:34:57,924 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/data/72faddd0d/a84f4ff2ca4f4047b0429ebb90947877/FLAGc031e2f89 [2018-11-18 08:34:58,235 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:58,236 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 08:34:58,242 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/data/72faddd0d/a84f4ff2ca4f4047b0429ebb90947877/FLAGc031e2f89 [2018-11-18 08:34:58,251 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/data/72faddd0d/a84f4ff2ca4f4047b0429ebb90947877 [2018-11-18 08:34:58,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:58,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:34:58,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:58,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:58,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:58,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411459c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58, skipping insertion in model container [2018-11-18 08:34:58,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:58,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:58,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:58,396 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:58,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:58,428 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:58,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58 WrapperNode [2018-11-18 08:34:58,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:58,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:58,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:58,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:58,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... [2018-11-18 08:34:58,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:58,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:58,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:58,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:58,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:34:58,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:34:58,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:58,547 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:34:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:34:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:34:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:34:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:34:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:58,807 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:58,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:58 BoogieIcfgContainer [2018-11-18 08:34:58,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:58,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:34:58,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:34:58,812 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:34:58,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:58" (1/3) ... [2018-11-18 08:34:58,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c10b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:58, skipping insertion in model container [2018-11-18 08:34:58,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:58" (2/3) ... [2018-11-18 08:34:58,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c10b711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:58, skipping insertion in model container [2018-11-18 08:34:58,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:58" (3/3) ... [2018-11-18 08:34:58,815 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 08:34:58,824 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:34:58,831 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 08:34:58,845 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 08:34:58,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:58,871 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:34:58,871 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 08:34:58,871 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:34:58,872 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:58,872 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:58,872 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:34:58,872 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:58,872 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:34:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-18 08:34:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 08:34:58,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:58,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:58,897 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:58,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1553015003, now seen corresponding path program 1 times [2018-11-18 08:34:58,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:58,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:58,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,058 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-11-18 08:34:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,101 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2018-11-18 08:34:59,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 08:34:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,112 INFO L225 Difference]: With dead ends: 113 [2018-11-18 08:34:59,112 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 08:34:59,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 08:34:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-11-18 08:34:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 08:34:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2018-11-18 08:34:59,147 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2018-11-18 08:34:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,147 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2018-11-18 08:34:59,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2018-11-18 08:34:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 08:34:59,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,148 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,148 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -35332899, now seen corresponding path program 1 times [2018-11-18 08:34:59,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,206 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand 3 states. [2018-11-18 08:34:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,239 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2018-11-18 08:34:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 08:34:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,240 INFO L225 Difference]: With dead ends: 160 [2018-11-18 08:34:59,240 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 08:34:59,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 08:34:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-18 08:34:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-18 08:34:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 175 transitions. [2018-11-18 08:34:59,247 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 175 transitions. Word has length 25 [2018-11-18 08:34:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,248 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 175 transitions. [2018-11-18 08:34:59,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2018-11-18 08:34:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:34:59,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,248 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,249 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,249 INFO L82 PathProgramCache]: Analyzing trace with hash 899036922, now seen corresponding path program 1 times [2018-11-18 08:34:59,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,296 INFO L87 Difference]: Start difference. First operand 96 states and 175 transitions. Second operand 3 states. [2018-11-18 08:34:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,310 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2018-11-18 08:34:59,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 08:34:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,311 INFO L225 Difference]: With dead ends: 148 [2018-11-18 08:34:59,311 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 08:34:59,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 08:34:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-18 08:34:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 08:34:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 178 transitions. [2018-11-18 08:34:59,319 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 178 transitions. Word has length 26 [2018-11-18 08:34:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,320 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 178 transitions. [2018-11-18 08:34:59,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 178 transitions. [2018-11-18 08:34:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:34:59,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,321 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1095107784, now seen corresponding path program 1 times [2018-11-18 08:34:59,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,365 INFO L87 Difference]: Start difference. First operand 100 states and 178 transitions. Second operand 3 states. [2018-11-18 08:34:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,384 INFO L93 Difference]: Finished difference Result 189 states and 341 transitions. [2018-11-18 08:34:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 08:34:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,386 INFO L225 Difference]: With dead ends: 189 [2018-11-18 08:34:59,386 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 08:34:59,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 08:34:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-11-18 08:34:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 08:34:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 235 transitions. [2018-11-18 08:34:59,398 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 235 transitions. Word has length 26 [2018-11-18 08:34:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,398 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 235 transitions. [2018-11-18 08:34:59,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 235 transitions. [2018-11-18 08:34:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 08:34:59,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1611511610, now seen corresponding path program 1 times [2018-11-18 08:34:59,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,435 INFO L87 Difference]: Start difference. First operand 131 states and 235 transitions. Second operand 3 states. [2018-11-18 08:34:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,456 INFO L93 Difference]: Finished difference Result 311 states and 565 transitions. [2018-11-18 08:34:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 08:34:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,458 INFO L225 Difference]: With dead ends: 311 [2018-11-18 08:34:59,458 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 08:34:59,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 08:34:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-11-18 08:34:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-18 08:34:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 335 transitions. [2018-11-18 08:34:59,466 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 335 transitions. Word has length 26 [2018-11-18 08:34:59,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,467 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 335 transitions. [2018-11-18 08:34:59,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 335 transitions. [2018-11-18 08:34:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:34:59,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,468 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,468 INFO L82 PathProgramCache]: Analyzing trace with hash 411609490, now seen corresponding path program 1 times [2018-11-18 08:34:59,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,503 INFO L87 Difference]: Start difference. First operand 187 states and 335 transitions. Second operand 3 states. [2018-11-18 08:34:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,517 INFO L93 Difference]: Finished difference Result 280 states and 500 transitions. [2018-11-18 08:34:59,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 08:34:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,519 INFO L225 Difference]: With dead ends: 280 [2018-11-18 08:34:59,519 INFO L226 Difference]: Without dead ends: 191 [2018-11-18 08:34:59,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-18 08:34:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-18 08:34:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 08:34:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 335 transitions. [2018-11-18 08:34:59,527 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 335 transitions. Word has length 27 [2018-11-18 08:34:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,528 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 335 transitions. [2018-11-18 08:34:59,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2018-11-18 08:34:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:34:59,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,529 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,530 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1582535216, now seen corresponding path program 1 times [2018-11-18 08:34:59,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,562 INFO L87 Difference]: Start difference. First operand 189 states and 335 transitions. Second operand 3 states. [2018-11-18 08:34:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,583 INFO L93 Difference]: Finished difference Result 357 states and 641 transitions. [2018-11-18 08:34:59,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 08:34:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,585 INFO L225 Difference]: With dead ends: 357 [2018-11-18 08:34:59,585 INFO L226 Difference]: Without dead ends: 355 [2018-11-18 08:34:59,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-18 08:34:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 253. [2018-11-18 08:34:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-18 08:34:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 447 transitions. [2018-11-18 08:34:59,596 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 447 transitions. Word has length 27 [2018-11-18 08:34:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 447 transitions. [2018-11-18 08:34:59,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 447 transitions. [2018-11-18 08:34:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:34:59,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,600 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1124084178, now seen corresponding path program 1 times [2018-11-18 08:34:59,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,640 INFO L87 Difference]: Start difference. First operand 253 states and 447 transitions. Second operand 3 states. [2018-11-18 08:34:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,670 INFO L93 Difference]: Finished difference Result 605 states and 1077 transitions. [2018-11-18 08:34:59,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 08:34:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,672 INFO L225 Difference]: With dead ends: 605 [2018-11-18 08:34:59,672 INFO L226 Difference]: Without dead ends: 363 [2018-11-18 08:34:59,673 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-18 08:34:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-11-18 08:34:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-18 08:34:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 635 transitions. [2018-11-18 08:34:59,684 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 635 transitions. Word has length 27 [2018-11-18 08:34:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,685 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 635 transitions. [2018-11-18 08:34:59,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 635 transitions. [2018-11-18 08:34:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:34:59,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,686 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,686 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1813738673, now seen corresponding path program 1 times [2018-11-18 08:34:59,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,715 INFO L87 Difference]: Start difference. First operand 361 states and 635 transitions. Second operand 3 states. [2018-11-18 08:34:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,737 INFO L93 Difference]: Finished difference Result 541 states and 949 transitions. [2018-11-18 08:34:59,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 08:34:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,739 INFO L225 Difference]: With dead ends: 541 [2018-11-18 08:34:59,740 INFO L226 Difference]: Without dead ends: 367 [2018-11-18 08:34:59,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-18 08:34:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-11-18 08:34:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-18 08:34:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 635 transitions. [2018-11-18 08:34:59,752 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 635 transitions. Word has length 28 [2018-11-18 08:34:59,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,752 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 635 transitions. [2018-11-18 08:34:59,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 635 transitions. [2018-11-18 08:34:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:34:59,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,755 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash 487083917, now seen corresponding path program 1 times [2018-11-18 08:34:59,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,781 INFO L87 Difference]: Start difference. First operand 365 states and 635 transitions. Second operand 3 states. [2018-11-18 08:34:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,809 INFO L93 Difference]: Finished difference Result 685 states and 1209 transitions. [2018-11-18 08:34:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 08:34:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,811 INFO L225 Difference]: With dead ends: 685 [2018-11-18 08:34:59,811 INFO L226 Difference]: Without dead ends: 683 [2018-11-18 08:34:59,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-18 08:34:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 497. [2018-11-18 08:34:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-11-18 08:34:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 855 transitions. [2018-11-18 08:34:59,822 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 855 transitions. Word has length 28 [2018-11-18 08:34:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,823 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 855 transitions. [2018-11-18 08:34:59,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 855 transitions. [2018-11-18 08:34:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:34:59,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,824 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1101263985, now seen corresponding path program 1 times [2018-11-18 08:34:59,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,859 INFO L87 Difference]: Start difference. First operand 497 states and 855 transitions. Second operand 3 states. [2018-11-18 08:34:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,887 INFO L93 Difference]: Finished difference Result 1189 states and 2057 transitions. [2018-11-18 08:34:59,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 08:34:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,889 INFO L225 Difference]: With dead ends: 1189 [2018-11-18 08:34:59,889 INFO L226 Difference]: Without dead ends: 707 [2018-11-18 08:34:59,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-18 08:34:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 705. [2018-11-18 08:34:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-18 08:34:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1207 transitions. [2018-11-18 08:34:59,905 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1207 transitions. Word has length 28 [2018-11-18 08:34:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,905 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 1207 transitions. [2018-11-18 08:34:59,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1207 transitions. [2018-11-18 08:34:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 08:34:59,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,907 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2080054649, now seen corresponding path program 1 times [2018-11-18 08:34:59,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,935 INFO L87 Difference]: Start difference. First operand 705 states and 1207 transitions. Second operand 3 states. [2018-11-18 08:34:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:59,955 INFO L93 Difference]: Finished difference Result 1057 states and 1805 transitions. [2018-11-18 08:34:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:34:59,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 08:34:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:34:59,957 INFO L225 Difference]: With dead ends: 1057 [2018-11-18 08:34:59,957 INFO L226 Difference]: Without dead ends: 715 [2018-11-18 08:34:59,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-18 08:34:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-18 08:34:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 08:34:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1207 transitions. [2018-11-18 08:34:59,971 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1207 transitions. Word has length 29 [2018-11-18 08:34:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:34:59,971 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 1207 transitions. [2018-11-18 08:34:59,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:34:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1207 transitions. [2018-11-18 08:34:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 08:34:59,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:34:59,972 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:34:59,973 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:34:59,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash 220767941, now seen corresponding path program 1 times [2018-11-18 08:34:59,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:59,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:59,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:34:59,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:34:59,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:34:59,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:34:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:34:59,991 INFO L87 Difference]: Start difference. First operand 713 states and 1207 transitions. Second operand 3 states. [2018-11-18 08:35:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,018 INFO L93 Difference]: Finished difference Result 2077 states and 3513 transitions. [2018-11-18 08:35:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 08:35:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,021 INFO L225 Difference]: With dead ends: 2077 [2018-11-18 08:35:00,021 INFO L226 Difference]: Without dead ends: 1387 [2018-11-18 08:35:00,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-11-18 08:35:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1385. [2018-11-18 08:35:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-18 08:35:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2311 transitions. [2018-11-18 08:35:00,046 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2311 transitions. Word has length 29 [2018-11-18 08:35:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,046 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 2311 transitions. [2018-11-18 08:35:00,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2311 transitions. [2018-11-18 08:35:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 08:35:00,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,048 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1809115843, now seen corresponding path program 1 times [2018-11-18 08:35:00,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,067 INFO L87 Difference]: Start difference. First operand 1385 states and 2311 transitions. Second operand 3 states. [2018-11-18 08:35:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,099 INFO L93 Difference]: Finished difference Result 1725 states and 2937 transitions. [2018-11-18 08:35:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 08:35:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,103 INFO L225 Difference]: With dead ends: 1725 [2018-11-18 08:35:00,103 INFO L226 Difference]: Without dead ends: 1723 [2018-11-18 08:35:00,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-18 08:35:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1385. [2018-11-18 08:35:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-18 08:35:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2295 transitions. [2018-11-18 08:35:00,129 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2295 transitions. Word has length 29 [2018-11-18 08:35:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,129 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 2295 transitions. [2018-11-18 08:35:00,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2295 transitions. [2018-11-18 08:35:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:35:00,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,132 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1745914972, now seen corresponding path program 1 times [2018-11-18 08:35:00,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,156 INFO L87 Difference]: Start difference. First operand 1385 states and 2295 transitions. Second operand 3 states. [2018-11-18 08:35:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,196 INFO L93 Difference]: Finished difference Result 2557 states and 4313 transitions. [2018-11-18 08:35:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 08:35:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,201 INFO L225 Difference]: With dead ends: 2557 [2018-11-18 08:35:00,201 INFO L226 Difference]: Without dead ends: 2555 [2018-11-18 08:35:00,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-11-18 08:35:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1945. [2018-11-18 08:35:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-18 08:35:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3159 transitions. [2018-11-18 08:35:00,236 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3159 transitions. Word has length 30 [2018-11-18 08:35:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,237 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 3159 transitions. [2018-11-18 08:35:00,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3159 transitions. [2018-11-18 08:35:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 08:35:00,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,239 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,239 INFO L82 PathProgramCache]: Analyzing trace with hash 960704422, now seen corresponding path program 1 times [2018-11-18 08:35:00,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,263 INFO L87 Difference]: Start difference. First operand 1945 states and 3159 transitions. Second operand 3 states. [2018-11-18 08:35:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,301 INFO L93 Difference]: Finished difference Result 4637 states and 7577 transitions. [2018-11-18 08:35:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 08:35:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,306 INFO L225 Difference]: With dead ends: 4637 [2018-11-18 08:35:00,306 INFO L226 Difference]: Without dead ends: 2715 [2018-11-18 08:35:00,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2018-11-18 08:35:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2713. [2018-11-18 08:35:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2018-11-18 08:35:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4391 transitions. [2018-11-18 08:35:00,358 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4391 transitions. Word has length 30 [2018-11-18 08:35:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,358 INFO L480 AbstractCegarLoop]: Abstraction has 2713 states and 4391 transitions. [2018-11-18 08:35:00,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4391 transitions. [2018-11-18 08:35:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:35:00,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,361 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1711424506, now seen corresponding path program 1 times [2018-11-18 08:35:00,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,380 INFO L87 Difference]: Start difference. First operand 2713 states and 4391 transitions. Second operand 3 states. [2018-11-18 08:35:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,421 INFO L93 Difference]: Finished difference Result 4093 states and 6617 transitions. [2018-11-18 08:35:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:35:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,426 INFO L225 Difference]: With dead ends: 4093 [2018-11-18 08:35:00,426 INFO L226 Difference]: Without dead ends: 2763 [2018-11-18 08:35:00,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2018-11-18 08:35:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2018-11-18 08:35:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-11-18 08:35:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4423 transitions. [2018-11-18 08:35:00,480 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4423 transitions. Word has length 31 [2018-11-18 08:35:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,480 INFO L480 AbstractCegarLoop]: Abstraction has 2761 states and 4423 transitions. [2018-11-18 08:35:00,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4423 transitions. [2018-11-18 08:35:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:35:00,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,482 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash -282720200, now seen corresponding path program 1 times [2018-11-18 08:35:00,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,506 INFO L87 Difference]: Start difference. First operand 2761 states and 4423 transitions. Second operand 3 states. [2018-11-18 08:35:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,550 INFO L93 Difference]: Finished difference Result 5005 states and 8169 transitions. [2018-11-18 08:35:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:35:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,558 INFO L225 Difference]: With dead ends: 5005 [2018-11-18 08:35:00,558 INFO L226 Difference]: Without dead ends: 5003 [2018-11-18 08:35:00,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-18 08:35:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3913. [2018-11-18 08:35:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-18 08:35:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 6119 transitions. [2018-11-18 08:35:00,618 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 6119 transitions. Word has length 31 [2018-11-18 08:35:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,619 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 6119 transitions. [2018-11-18 08:35:00,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 6119 transitions. [2018-11-18 08:35:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:35:00,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,622 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1871068102, now seen corresponding path program 1 times [2018-11-18 08:35:00,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,639 INFO L87 Difference]: Start difference. First operand 3913 states and 6119 transitions. Second operand 3 states. [2018-11-18 08:35:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,711 INFO L93 Difference]: Finished difference Result 9229 states and 14505 transitions. [2018-11-18 08:35:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 08:35:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,725 INFO L225 Difference]: With dead ends: 9229 [2018-11-18 08:35:00,725 INFO L226 Difference]: Without dead ends: 5387 [2018-11-18 08:35:00,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-18 08:35:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5385. [2018-11-18 08:35:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-11-18 08:35:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8391 transitions. [2018-11-18 08:35:00,820 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8391 transitions. Word has length 31 [2018-11-18 08:35:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:00,820 INFO L480 AbstractCegarLoop]: Abstraction has 5385 states and 8391 transitions. [2018-11-18 08:35:00,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8391 transitions. [2018-11-18 08:35:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 08:35:00,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:00,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:00,823 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:00,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash -174177477, now seen corresponding path program 1 times [2018-11-18 08:35:00,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:00,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:00,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:00,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,842 INFO L87 Difference]: Start difference. First operand 5385 states and 8391 transitions. Second operand 3 states. [2018-11-18 08:35:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:00,928 INFO L93 Difference]: Finished difference Result 8077 states and 12553 transitions. [2018-11-18 08:35:00,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:00,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 08:35:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:00,938 INFO L225 Difference]: With dead ends: 8077 [2018-11-18 08:35:00,938 INFO L226 Difference]: Without dead ends: 5451 [2018-11-18 08:35:00,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2018-11-18 08:35:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5449. [2018-11-18 08:35:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2018-11-18 08:35:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8391 transitions. [2018-11-18 08:35:01,015 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8391 transitions. Word has length 32 [2018-11-18 08:35:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:01,015 INFO L480 AbstractCegarLoop]: Abstraction has 5449 states and 8391 transitions. [2018-11-18 08:35:01,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8391 transitions. [2018-11-18 08:35:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 08:35:01,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:01,018 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:01,018 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:01,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2126645113, now seen corresponding path program 1 times [2018-11-18 08:35:01,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:01,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:01,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:01,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:01,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:01,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:01,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:01,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:01,034 INFO L87 Difference]: Start difference. First operand 5449 states and 8391 transitions. Second operand 3 states. [2018-11-18 08:35:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:01,107 INFO L93 Difference]: Finished difference Result 9741 states and 15305 transitions. [2018-11-18 08:35:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:01,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 08:35:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:01,117 INFO L225 Difference]: With dead ends: 9741 [2018-11-18 08:35:01,118 INFO L226 Difference]: Without dead ends: 9739 [2018-11-18 08:35:01,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2018-11-18 08:35:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7817. [2018-11-18 08:35:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7817 states. [2018-11-18 08:35:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 11719 transitions. [2018-11-18 08:35:01,258 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 11719 transitions. Word has length 32 [2018-11-18 08:35:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:01,258 INFO L480 AbstractCegarLoop]: Abstraction has 7817 states and 11719 transitions. [2018-11-18 08:35:01,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 11719 transitions. [2018-11-18 08:35:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 08:35:01,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:01,264 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:01,265 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:01,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash 538297211, now seen corresponding path program 1 times [2018-11-18 08:35:01,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:01,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:01,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:01,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:01,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:01,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:01,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:01,291 INFO L87 Difference]: Start difference. First operand 7817 states and 11719 transitions. Second operand 3 states. [2018-11-18 08:35:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:01,452 INFO L93 Difference]: Finished difference Result 18317 states and 27593 transitions. [2018-11-18 08:35:01,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:01,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 08:35:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:01,469 INFO L225 Difference]: With dead ends: 18317 [2018-11-18 08:35:01,470 INFO L226 Difference]: Without dead ends: 10635 [2018-11-18 08:35:01,479 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2018-11-18 08:35:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10633. [2018-11-18 08:35:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2018-11-18 08:35:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 15879 transitions. [2018-11-18 08:35:01,696 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 15879 transitions. Word has length 32 [2018-11-18 08:35:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:01,696 INFO L480 AbstractCegarLoop]: Abstraction has 10633 states and 15879 transitions. [2018-11-18 08:35:01,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 15879 transitions. [2018-11-18 08:35:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:35:01,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:01,705 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:01,705 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:01,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1501703535, now seen corresponding path program 1 times [2018-11-18 08:35:01,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:01,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:01,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:01,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:01,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:01,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:01,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:01,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:01,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:01,735 INFO L87 Difference]: Start difference. First operand 10633 states and 15879 transitions. Second operand 3 states. [2018-11-18 08:35:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:01,878 INFO L93 Difference]: Finished difference Result 15949 states and 23753 transitions. [2018-11-18 08:35:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:01,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:35:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:01,895 INFO L225 Difference]: With dead ends: 15949 [2018-11-18 08:35:01,895 INFO L226 Difference]: Without dead ends: 10763 [2018-11-18 08:35:01,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2018-11-18 08:35:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2018-11-18 08:35:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10761 states. [2018-11-18 08:35:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 15879 transitions. [2018-11-18 08:35:02,108 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 15879 transitions. Word has length 33 [2018-11-18 08:35:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:02,108 INFO L480 AbstractCegarLoop]: Abstraction has 10761 states and 15879 transitions. [2018-11-18 08:35:02,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 15879 transitions. [2018-11-18 08:35:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:35:02,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:02,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:02,117 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:02,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:02,117 INFO L82 PathProgramCache]: Analyzing trace with hash -492441171, now seen corresponding path program 1 times [2018-11-18 08:35:02,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:02,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:02,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:02,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:02,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:02,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:02,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:02,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:02,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:02,139 INFO L87 Difference]: Start difference. First operand 10761 states and 15879 transitions. Second operand 3 states. [2018-11-18 08:35:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:02,335 INFO L93 Difference]: Finished difference Result 18957 states and 28553 transitions. [2018-11-18 08:35:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:02,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:35:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:02,366 INFO L225 Difference]: With dead ends: 18957 [2018-11-18 08:35:02,366 INFO L226 Difference]: Without dead ends: 18955 [2018-11-18 08:35:02,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2018-11-18 08:35:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 15625. [2018-11-18 08:35:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15625 states. [2018-11-18 08:35:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15625 states to 15625 states and 22407 transitions. [2018-11-18 08:35:02,703 INFO L78 Accepts]: Start accepts. Automaton has 15625 states and 22407 transitions. Word has length 33 [2018-11-18 08:35:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:02,703 INFO L480 AbstractCegarLoop]: Abstraction has 15625 states and 22407 transitions. [2018-11-18 08:35:02,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15625 states and 22407 transitions. [2018-11-18 08:35:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 08:35:02,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:02,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:02,719 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:02,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2080789073, now seen corresponding path program 1 times [2018-11-18 08:35:02,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:02,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:02,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:02,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:02,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:02,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:02,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:02,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:02,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:02,736 INFO L87 Difference]: Start difference. First operand 15625 states and 22407 transitions. Second operand 3 states. [2018-11-18 08:35:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:02,965 INFO L93 Difference]: Finished difference Result 36365 states and 52361 transitions. [2018-11-18 08:35:02,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:02,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 08:35:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:02,987 INFO L225 Difference]: With dead ends: 36365 [2018-11-18 08:35:02,988 INFO L226 Difference]: Without dead ends: 21003 [2018-11-18 08:35:03,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-11-18 08:35:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 21001. [2018-11-18 08:35:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21001 states. [2018-11-18 08:35:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21001 states to 21001 states and 29959 transitions. [2018-11-18 08:35:03,372 INFO L78 Accepts]: Start accepts. Automaton has 21001 states and 29959 transitions. Word has length 33 [2018-11-18 08:35:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:03,372 INFO L480 AbstractCegarLoop]: Abstraction has 21001 states and 29959 transitions. [2018-11-18 08:35:03,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21001 states and 29959 transitions. [2018-11-18 08:35:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:35:03,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:03,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:03,386 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:03,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1914407696, now seen corresponding path program 1 times [2018-11-18 08:35:03,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:03,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:03,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:03,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:03,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:03,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:03,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:03,403 INFO L87 Difference]: Start difference. First operand 21001 states and 29959 transitions. Second operand 3 states. [2018-11-18 08:35:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:03,631 INFO L93 Difference]: Finished difference Result 31501 states and 44809 transitions. [2018-11-18 08:35:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:03,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:35:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:03,647 INFO L225 Difference]: With dead ends: 31501 [2018-11-18 08:35:03,647 INFO L226 Difference]: Without dead ends: 21259 [2018-11-18 08:35:03,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2018-11-18 08:35:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21257. [2018-11-18 08:35:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2018-11-18 08:35:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29959 transitions. [2018-11-18 08:35:03,879 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29959 transitions. Word has length 34 [2018-11-18 08:35:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:03,880 INFO L480 AbstractCegarLoop]: Abstraction has 21257 states and 29959 transitions. [2018-11-18 08:35:03,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29959 transitions. [2018-11-18 08:35:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:35:03,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:03,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:03,888 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:03,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash -79737010, now seen corresponding path program 1 times [2018-11-18 08:35:03,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:03,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:03,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:03,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:03,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:03,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:03,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:03,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:03,918 INFO L87 Difference]: Start difference. First operand 21257 states and 29959 transitions. Second operand 3 states. [2018-11-18 08:35:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:04,149 INFO L93 Difference]: Finished difference Result 36877 states and 53001 transitions. [2018-11-18 08:35:04,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:04,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:35:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:04,178 INFO L225 Difference]: With dead ends: 36877 [2018-11-18 08:35:04,178 INFO L226 Difference]: Without dead ends: 36875 [2018-11-18 08:35:04,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36875 states. [2018-11-18 08:35:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36875 to 31241. [2018-11-18 08:35:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31241 states. [2018-11-18 08:35:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 42759 transitions. [2018-11-18 08:35:04,595 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 42759 transitions. Word has length 34 [2018-11-18 08:35:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:04,595 INFO L480 AbstractCegarLoop]: Abstraction has 31241 states and 42759 transitions. [2018-11-18 08:35:04,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 42759 transitions. [2018-11-18 08:35:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:35:04,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:04,610 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:04,610 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:04,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084912, now seen corresponding path program 1 times [2018-11-18 08:35:04,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:04,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:04,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:04,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:04,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:04,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:04,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:04,647 INFO L87 Difference]: Start difference. First operand 31241 states and 42759 transitions. Second operand 3 states. [2018-11-18 08:35:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:04,950 INFO L93 Difference]: Finished difference Result 72205 states and 99081 transitions. [2018-11-18 08:35:04,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:04,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 08:35:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:04,985 INFO L225 Difference]: With dead ends: 72205 [2018-11-18 08:35:04,985 INFO L226 Difference]: Without dead ends: 41483 [2018-11-18 08:35:05,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:05,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2018-11-18 08:35:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 41481. [2018-11-18 08:35:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41481 states. [2018-11-18 08:35:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41481 states to 41481 states and 56327 transitions. [2018-11-18 08:35:05,561 INFO L78 Accepts]: Start accepts. Automaton has 41481 states and 56327 transitions. Word has length 34 [2018-11-18 08:35:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:05,561 INFO L480 AbstractCegarLoop]: Abstraction has 41481 states and 56327 transitions. [2018-11-18 08:35:05,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 41481 states and 56327 transitions. [2018-11-18 08:35:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:35:05,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:05,573 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:05,573 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:05,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335140, now seen corresponding path program 1 times [2018-11-18 08:35:05,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:05,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:05,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:05,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:05,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:05,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:05,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:05,611 INFO L87 Difference]: Start difference. First operand 41481 states and 56327 transitions. Second operand 3 states. [2018-11-18 08:35:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:05,925 INFO L93 Difference]: Finished difference Result 62221 states and 84233 transitions. [2018-11-18 08:35:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:05,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 08:35:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:05,955 INFO L225 Difference]: With dead ends: 62221 [2018-11-18 08:35:05,955 INFO L226 Difference]: Without dead ends: 41995 [2018-11-18 08:35:05,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41995 states. [2018-11-18 08:35:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41995 to 41993. [2018-11-18 08:35:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41993 states. [2018-11-18 08:35:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41993 states to 41993 states and 56327 transitions. [2018-11-18 08:35:06,483 INFO L78 Accepts]: Start accepts. Automaton has 41993 states and 56327 transitions. Word has length 35 [2018-11-18 08:35:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:06,484 INFO L480 AbstractCegarLoop]: Abstraction has 41993 states and 56327 transitions. [2018-11-18 08:35:06,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41993 states and 56327 transitions. [2018-11-18 08:35:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:35:06,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:06,503 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:06,503 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:06,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:06,504 INFO L82 PathProgramCache]: Analyzing trace with hash -170809566, now seen corresponding path program 1 times [2018-11-18 08:35:06,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:06,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:06,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:06,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:06,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:06,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:06,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:06,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:06,536 INFO L87 Difference]: Start difference. First operand 41993 states and 56327 transitions. Second operand 3 states. [2018-11-18 08:35:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:07,165 INFO L93 Difference]: Finished difference Result 71693 states and 97801 transitions. [2018-11-18 08:35:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:07,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 08:35:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:07,211 INFO L225 Difference]: With dead ends: 71693 [2018-11-18 08:35:07,211 INFO L226 Difference]: Without dead ends: 71691 [2018-11-18 08:35:07,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71691 states. [2018-11-18 08:35:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71691 to 62473. [2018-11-18 08:35:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62473 states. [2018-11-18 08:35:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62473 states to 62473 states and 81415 transitions. [2018-11-18 08:35:08,068 INFO L78 Accepts]: Start accepts. Automaton has 62473 states and 81415 transitions. Word has length 35 [2018-11-18 08:35:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:08,068 INFO L480 AbstractCegarLoop]: Abstraction has 62473 states and 81415 transitions. [2018-11-18 08:35:08,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 62473 states and 81415 transitions. [2018-11-18 08:35:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 08:35:08,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:08,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:08,102 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:08,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1759157468, now seen corresponding path program 1 times [2018-11-18 08:35:08,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:08,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:08,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:08,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:08,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:08,135 INFO L87 Difference]: Start difference. First operand 62473 states and 81415 transitions. Second operand 3 states. [2018-11-18 08:35:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:08,791 INFO L93 Difference]: Finished difference Result 143373 states and 186889 transitions. [2018-11-18 08:35:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:08,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 08:35:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:08,856 INFO L225 Difference]: With dead ends: 143373 [2018-11-18 08:35:08,856 INFO L226 Difference]: Without dead ends: 81931 [2018-11-18 08:35:08,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81931 states. [2018-11-18 08:35:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81931 to 81929. [2018-11-18 08:35:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81929 states. [2018-11-18 08:35:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81929 states to 81929 states and 105479 transitions. [2018-11-18 08:35:10,144 INFO L78 Accepts]: Start accepts. Automaton has 81929 states and 105479 transitions. Word has length 35 [2018-11-18 08:35:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:10,144 INFO L480 AbstractCegarLoop]: Abstraction has 81929 states and 105479 transitions. [2018-11-18 08:35:10,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 81929 states and 105479 transitions. [2018-11-18 08:35:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:35:10,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:10,166 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:10,166 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:10,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash -999913755, now seen corresponding path program 1 times [2018-11-18 08:35:10,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:10,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:10,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:10,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:10,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:10,207 INFO L87 Difference]: Start difference. First operand 81929 states and 105479 transitions. Second operand 3 states. [2018-11-18 08:35:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:10,798 INFO L93 Difference]: Finished difference Result 122893 states and 157705 transitions. [2018-11-18 08:35:10,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:10,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 08:35:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:10,858 INFO L225 Difference]: With dead ends: 122893 [2018-11-18 08:35:10,858 INFO L226 Difference]: Without dead ends: 82955 [2018-11-18 08:35:10,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82955 states. [2018-11-18 08:35:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82955 to 82953. [2018-11-18 08:35:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82953 states. [2018-11-18 08:35:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82953 states to 82953 states and 105479 transitions. [2018-11-18 08:35:12,074 INFO L78 Accepts]: Start accepts. Automaton has 82953 states and 105479 transitions. Word has length 36 [2018-11-18 08:35:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:12,075 INFO L480 AbstractCegarLoop]: Abstraction has 82953 states and 105479 transitions. [2018-11-18 08:35:12,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 82953 states and 105479 transitions. [2018-11-18 08:35:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:35:12,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:12,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:12,099 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:12,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1300908835, now seen corresponding path program 1 times [2018-11-18 08:35:12,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:12,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:12,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:12,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:12,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:12,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:12,134 INFO L87 Difference]: Start difference. First operand 82953 states and 105479 transitions. Second operand 3 states. [2018-11-18 08:35:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:13,128 INFO L93 Difference]: Finished difference Result 139277 states and 179209 transitions. [2018-11-18 08:35:13,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:13,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 08:35:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:13,239 INFO L225 Difference]: With dead ends: 139277 [2018-11-18 08:35:13,240 INFO L226 Difference]: Without dead ends: 139275 [2018-11-18 08:35:13,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139275 states. [2018-11-18 08:35:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139275 to 124937. [2018-11-18 08:35:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124937 states. [2018-11-18 08:35:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124937 states to 124937 states and 154631 transitions. [2018-11-18 08:35:14,830 INFO L78 Accepts]: Start accepts. Automaton has 124937 states and 154631 transitions. Word has length 36 [2018-11-18 08:35:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:14,830 INFO L480 AbstractCegarLoop]: Abstraction has 124937 states and 154631 transitions. [2018-11-18 08:35:14,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 124937 states and 154631 transitions. [2018-11-18 08:35:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 08:35:14,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:14,883 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:14,883 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:14,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -287439067, now seen corresponding path program 1 times [2018-11-18 08:35:14,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:14,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:14,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:14,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:14,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:14,919 INFO L87 Difference]: Start difference. First operand 124937 states and 154631 transitions. Second operand 3 states. [2018-11-18 08:35:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:16,290 INFO L93 Difference]: Finished difference Result 284685 states and 351241 transitions. [2018-11-18 08:35:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:16,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 08:35:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:16,736 INFO L225 Difference]: With dead ends: 284685 [2018-11-18 08:35:16,736 INFO L226 Difference]: Without dead ends: 161803 [2018-11-18 08:35:16,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161803 states. [2018-11-18 08:35:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161803 to 161801. [2018-11-18 08:35:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161801 states. [2018-11-18 08:35:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161801 states to 161801 states and 196615 transitions. [2018-11-18 08:35:18,581 INFO L78 Accepts]: Start accepts. Automaton has 161801 states and 196615 transitions. Word has length 36 [2018-11-18 08:35:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:18,581 INFO L480 AbstractCegarLoop]: Abstraction has 161801 states and 196615 transitions. [2018-11-18 08:35:18,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 161801 states and 196615 transitions. [2018-11-18 08:35:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 08:35:18,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:18,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:18,631 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:18,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1673684057, now seen corresponding path program 1 times [2018-11-18 08:35:18,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:18,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:18,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:18,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:18,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:18,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:18,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:18,659 INFO L87 Difference]: Start difference. First operand 161801 states and 196615 transitions. Second operand 3 states. [2018-11-18 08:35:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:20,237 INFO L93 Difference]: Finished difference Result 242701 states and 293897 transitions. [2018-11-18 08:35:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:20,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 08:35:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:20,358 INFO L225 Difference]: With dead ends: 242701 [2018-11-18 08:35:20,358 INFO L226 Difference]: Without dead ends: 163851 [2018-11-18 08:35:20,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163851 states. [2018-11-18 08:35:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163851 to 163849. [2018-11-18 08:35:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163849 states. [2018-11-18 08:35:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163849 states to 163849 states and 196615 transitions. [2018-11-18 08:35:22,385 INFO L78 Accepts]: Start accepts. Automaton has 163849 states and 196615 transitions. Word has length 37 [2018-11-18 08:35:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:22,385 INFO L480 AbstractCegarLoop]: Abstraction has 163849 states and 196615 transitions. [2018-11-18 08:35:22,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 163849 states and 196615 transitions. [2018-11-18 08:35:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 08:35:22,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:22,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:22,442 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:22,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash -320460649, now seen corresponding path program 1 times [2018-11-18 08:35:22,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:22,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:22,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:22,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:22,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:22,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:22,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:22,466 INFO L87 Difference]: Start difference. First operand 163849 states and 196615 transitions. Second operand 3 states. [2018-11-18 08:35:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:25,185 INFO L93 Difference]: Finished difference Result 479245 states and 565257 transitions. [2018-11-18 08:35:25,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:25,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 08:35:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:25,445 INFO L225 Difference]: With dead ends: 479245 [2018-11-18 08:35:25,445 INFO L226 Difference]: Without dead ends: 319499 [2018-11-18 08:35:25,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319499 states. [2018-11-18 08:35:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319499 to 319497. [2018-11-18 08:35:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-18 08:35:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 368647 transitions. [2018-11-18 08:35:32,141 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 368647 transitions. Word has length 37 [2018-11-18 08:35:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:32,142 INFO L480 AbstractCegarLoop]: Abstraction has 319497 states and 368647 transitions. [2018-11-18 08:35:32,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 368647 transitions. [2018-11-18 08:35:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 08:35:32,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:32,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:32,252 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:32,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1267887253, now seen corresponding path program 1 times [2018-11-18 08:35:32,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:32,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:32,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:32,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:32,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:32,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:32,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:32,283 INFO L87 Difference]: Start difference. First operand 319497 states and 368647 transitions. Second operand 3 states. [2018-11-18 08:35:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:35,918 INFO L93 Difference]: Finished difference Result 339981 states and 397321 transitions. [2018-11-18 08:35:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:35,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 08:35:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:36,178 INFO L225 Difference]: With dead ends: 339981 [2018-11-18 08:35:36,178 INFO L226 Difference]: Without dead ends: 339979 [2018-11-18 08:35:36,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339979 states. [2018-11-18 08:35:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339979 to 319497. [2018-11-18 08:35:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-18 08:35:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 364551 transitions. [2018-11-18 08:35:40,574 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 364551 transitions. Word has length 37 [2018-11-18 08:35:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:40,574 INFO L480 AbstractCegarLoop]: Abstraction has 319497 states and 364551 transitions. [2018-11-18 08:35:40,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 364551 transitions. [2018-11-18 08:35:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 08:35:40,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:40,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:40,689 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:40,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1344129350, now seen corresponding path program 1 times [2018-11-18 08:35:40,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:40,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:40,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:40,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:40,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:40,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:40,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:40,703 INFO L87 Difference]: Start difference. First operand 319497 states and 364551 transitions. Second operand 3 states. [2018-11-18 08:35:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:48,094 INFO L93 Difference]: Finished difference Result 520203 states and 589832 transitions. [2018-11-18 08:35:48,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:48,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 08:35:48,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:48,462 INFO L225 Difference]: With dead ends: 520203 [2018-11-18 08:35:48,462 INFO L226 Difference]: Without dead ends: 520201 [2018-11-18 08:35:48,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520201 states. [2018-11-18 08:35:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520201 to 495625. [2018-11-18 08:35:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495625 states. [2018-11-18 08:35:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495625 states to 495625 states and 557063 transitions. [2018-11-18 08:35:54,226 INFO L78 Accepts]: Start accepts. Automaton has 495625 states and 557063 transitions. Word has length 38 [2018-11-18 08:35:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:54,227 INFO L480 AbstractCegarLoop]: Abstraction has 495625 states and 557063 transitions. [2018-11-18 08:35:54,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 495625 states and 557063 transitions. [2018-11-18 08:35:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 08:35:54,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:54,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:54,446 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 08:35:54,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:54,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1362490044, now seen corresponding path program 1 times [2018-11-18 08:35:54,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:54,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:54,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:54,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:54,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:54,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:54,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:54,475 INFO L87 Difference]: Start difference. First operand 495625 states and 557063 transitions. Second operand 3 states. [2018-11-18 08:36:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:00,585 INFO L93 Difference]: Finished difference Result 1118217 states and 1245191 transitions. [2018-11-18 08:36:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:36:00,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 08:36:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:00,586 INFO L225 Difference]: With dead ends: 1118217 [2018-11-18 08:36:00,586 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 08:36:00,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:36:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 08:36:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 08:36:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 08:36:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 08:36:00,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-11-18 08:36:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:00,914 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:36:00,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:36:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:36:00,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 08:36:00,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 08:36:00,964 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 08:36:00,964 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:36:00,964 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 08:36:00,964 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 08:36:00,965 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-18 08:36:00,965 INFO L425 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,966 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L428 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L421 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,967 INFO L425 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L428 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-18 08:36:00,968 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-18 08:36:00,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:36:00 BoogieIcfgContainer [2018-11-18 08:36:00,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:36:00,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:36:00,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:36:00,974 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:36:00,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:58" (3/4) ... [2018-11-18 08:36:00,978 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 08:36:00,983 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 08:36:00,984 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 08:36:00,988 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 08:36:00,989 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 08:36:00,989 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 08:36:01,039 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6e79966f-da98-4a64-bd64-d12d77cdb752/bin-2019/uautomizer/witness.graphml [2018-11-18 08:36:01,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:36:01,040 INFO L168 Benchmark]: Toolchain (without parser) took 62786.31 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 953.8 MB in the beginning and 1.6 GB in the end (delta: -654.9 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 08:36:01,041 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:36:01,041 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.36 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:01,041 INFO L168 Benchmark]: Boogie Preprocessor took 65.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:01,042 INFO L168 Benchmark]: RCFGBuilder took 312.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:01,042 INFO L168 Benchmark]: TraceAbstraction took 62165.94 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -486.3 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-18 08:36:01,042 INFO L168 Benchmark]: Witness Printer took 65.02 ms. Allocated memory is still 5.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:01,044 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.36 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 312.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62165.94 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -486.3 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 65.02 ms. Allocated memory is still 5.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. SAFE Result, 62.1s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 31.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4609 SDtfs, 2290 SDslu, 3157 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495625occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 28.7s AutomataMinimizationTime, 39 MinimizatonAttempts, 81961 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 75887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...