./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11_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_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/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 56f043bec3037ec37b4a132611abd4a337934428 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:49:34,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:49:34,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:49:34,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:49:34,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:49:34,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:49:34,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:49:34,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:49:34,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:49:34,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:49:34,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:49:34,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:49:34,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:49:34,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:49:34,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:49:34,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:49:34,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:49:34,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:49:34,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:49:34,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:49:34,986 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:49:34,987 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:49:34,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:49:34,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:49:34,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:49:34,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:49:34,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:49:34,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:49:34,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:49:34,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:49:34,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:49:34,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:49:34,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:49:34,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:49:34,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:49:34,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:49:34,994 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 11:49:35,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:49:35,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:49:35,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:49:35,002 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:49:35,002 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:49:35,002 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:49:35,002 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:49:35,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:49:35,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:49:35,004 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:49:35,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:49:35,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:49:35,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:49:35,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:49:35,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:49:35,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:49:35,004 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:49:35,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:49:35,005 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:49:35,005 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:49:35,005 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:49:35,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:49:35,005 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_c81d762b-fa57-48ac-85c3-8aa53c262662/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-18 11:49:35,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:49:35,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:49:35,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:49:35,043 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:49:35,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:49:35,044 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:49:35,089 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/data/cb580a7cf/8908c326c0714865a310f0bc73f00bb9/FLAG8a1e68a22 [2018-11-18 11:49:35,425 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:49:35,426 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:49:35,430 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/data/cb580a7cf/8908c326c0714865a310f0bc73f00bb9/FLAG8a1e68a22 [2018-11-18 11:49:35,852 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/data/cb580a7cf/8908c326c0714865a310f0bc73f00bb9 [2018-11-18 11:49:35,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:49:35,856 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 11:49:35,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:49:35,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:49:35,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:49:35,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:49:35" (1/1) ... [2018-11-18 11:49:35,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d293ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:35, skipping insertion in model container [2018-11-18 11:49:35,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:49:35" (1/1) ... [2018-11-18 11:49:35,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:49:35,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:49:35,995 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:49:35,998 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:49:36,016 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:49:36,027 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:49:36,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36 WrapperNode [2018-11-18 11:49:36,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:49:36,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:49:36,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:49:36,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:49:36,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... [2018-11-18 11:49:36,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:49:36,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:49:36,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:49:36,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:49:36,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/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 11:49:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:49:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:49:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:49:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 11:49:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 11:49:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:49:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:49:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:49:36,298 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:49:36,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:49:36 BoogieIcfgContainer [2018-11-18 11:49:36,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:49:36,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:49:36,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:49:36,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:49:36,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:49:35" (1/3) ... [2018-11-18 11:49:36,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a807e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:49:36, skipping insertion in model container [2018-11-18 11:49:36,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:49:36" (2/3) ... [2018-11-18 11:49:36,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a807e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:49:36, skipping insertion in model container [2018-11-18 11:49:36,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:49:36" (3/3) ... [2018-11-18 11:49:36,303 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:49:36,309 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:49:36,313 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:49:36,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:49:36,339 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:49:36,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:49:36,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:49:36,340 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:49:36,340 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:49:36,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:49:36,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:49:36,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:49:36,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:49:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-18 11:49:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:49:36,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,363 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] [2018-11-18 11:49:36,364 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1514281487, now seen corresponding path program 1 times [2018-11-18 11:49:36,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,484 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 11:49:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,497 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-11-18 11:49:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,527 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2018-11-18 11:49:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 11:49:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,535 INFO L225 Difference]: With dead ends: 95 [2018-11-18 11:49:36,535 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 11:49:36,538 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 11:49:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 11:49:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2018-11-18 11:49:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 11:49:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2018-11-18 11:49:36,567 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2018-11-18 11:49:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,567 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2018-11-18 11:49:36,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2018-11-18 11:49:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:49:36,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,568 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] [2018-11-18 11:49:36,568 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 503164237, now seen corresponding path program 1 times [2018-11-18 11:49:36,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,613 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 11:49:36,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,616 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand 3 states. [2018-11-18 11:49:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,652 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2018-11-18 11:49:36,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 11:49:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,654 INFO L225 Difference]: With dead ends: 130 [2018-11-18 11:49:36,654 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 11:49:36,655 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 11:49:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 11:49:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-18 11:49:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 11:49:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2018-11-18 11:49:36,667 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 22 [2018-11-18 11:49:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,667 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2018-11-18 11:49:36,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2018-11-18 11:49:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:49:36,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,668 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] [2018-11-18 11:49:36,668 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash -301701102, now seen corresponding path program 1 times [2018-11-18 11:49:36,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,716 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 11:49:36,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,717 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand 3 states. [2018-11-18 11:49:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,740 INFO L93 Difference]: Finished difference Result 121 states and 211 transitions. [2018-11-18 11:49:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:49:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,741 INFO L225 Difference]: With dead ends: 121 [2018-11-18 11:49:36,742 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 11:49:36,742 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 11:49:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 11:49:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-18 11:49:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 11:49:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 142 transitions. [2018-11-18 11:49:36,749 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 142 transitions. Word has length 23 [2018-11-18 11:49:36,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,749 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 142 transitions. [2018-11-18 11:49:36,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 142 transitions. [2018-11-18 11:49:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:49:36,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,750 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] [2018-11-18 11:49:36,750 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1581564780, now seen corresponding path program 1 times [2018-11-18 11:49:36,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,772 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 11:49:36,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,773 INFO L87 Difference]: Start difference. First operand 82 states and 142 transitions. Second operand 3 states. [2018-11-18 11:49:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,784 INFO L93 Difference]: Finished difference Result 153 states and 269 transitions. [2018-11-18 11:49:36,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:49:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,786 INFO L225 Difference]: With dead ends: 153 [2018-11-18 11:49:36,786 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 11:49:36,786 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 11:49:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 11:49:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2018-11-18 11:49:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 11:49:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 187 transitions. [2018-11-18 11:49:36,792 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 187 transitions. Word has length 23 [2018-11-18 11:49:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,792 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 187 transitions. [2018-11-18 11:49:36,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 187 transitions. [2018-11-18 11:49:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:49:36,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,793 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] [2018-11-18 11:49:36,794 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1702285266, now seen corresponding path program 1 times [2018-11-18 11:49:36,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,820 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 11:49:36,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,821 INFO L87 Difference]: Start difference. First operand 107 states and 187 transitions. Second operand 3 states. [2018-11-18 11:49:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,847 INFO L93 Difference]: Finished difference Result 251 states and 445 transitions. [2018-11-18 11:49:36,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:49:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,849 INFO L225 Difference]: With dead ends: 251 [2018-11-18 11:49:36,849 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 11:49:36,850 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 11:49:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 11:49:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-18 11:49:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 11:49:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 263 transitions. [2018-11-18 11:49:36,859 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 263 transitions. Word has length 23 [2018-11-18 11:49:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,860 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 263 transitions. [2018-11-18 11:49:36,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 263 transitions. [2018-11-18 11:49:36,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:49:36,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,861 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] [2018-11-18 11:49:36,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1783654526, now seen corresponding path program 1 times [2018-11-18 11:49:36,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,885 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 11:49:36,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,886 INFO L87 Difference]: Start difference. First operand 151 states and 263 transitions. Second operand 3 states. [2018-11-18 11:49:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,917 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2018-11-18 11:49:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:49:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,918 INFO L225 Difference]: With dead ends: 226 [2018-11-18 11:49:36,918 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 11:49:36,918 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 11:49:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 11:49:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-18 11:49:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 11:49:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 263 transitions. [2018-11-18 11:49:36,924 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 263 transitions. Word has length 24 [2018-11-18 11:49:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,925 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 263 transitions. [2018-11-18 11:49:36,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 263 transitions. [2018-11-18 11:49:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:49:36,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,926 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] [2018-11-18 11:49:36,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1231449092, now seen corresponding path program 1 times [2018-11-18 11:49:36,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:36,953 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 11:49:36,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:36,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:36,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:36,954 INFO L87 Difference]: Start difference. First operand 153 states and 263 transitions. Second operand 3 states. [2018-11-18 11:49:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:36,971 INFO L93 Difference]: Finished difference Result 285 states and 497 transitions. [2018-11-18 11:49:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:36,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:49:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:36,973 INFO L225 Difference]: With dead ends: 285 [2018-11-18 11:49:36,973 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 11:49:36,974 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 11:49:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 11:49:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 205. [2018-11-18 11:49:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-18 11:49:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 351 transitions. [2018-11-18 11:49:36,984 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 351 transitions. Word has length 24 [2018-11-18 11:49:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:36,984 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 351 transitions. [2018-11-18 11:49:36,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 351 transitions. [2018-11-18 11:49:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:49:36,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:36,987 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] [2018-11-18 11:49:36,987 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:36,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 220331842, now seen corresponding path program 1 times [2018-11-18 11:49:36,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,009 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 11:49:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,010 INFO L87 Difference]: Start difference. First operand 205 states and 351 transitions. Second operand 3 states. [2018-11-18 11:49:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,030 INFO L93 Difference]: Finished difference Result 485 states and 837 transitions. [2018-11-18 11:49:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:49:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,032 INFO L225 Difference]: With dead ends: 485 [2018-11-18 11:49:37,032 INFO L226 Difference]: Without dead ends: 291 [2018-11-18 11:49:37,033 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 11:49:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-18 11:49:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-11-18 11:49:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-18 11:49:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 491 transitions. [2018-11-18 11:49:37,043 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 491 transitions. Word has length 24 [2018-11-18 11:49:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,044 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 491 transitions. [2018-11-18 11:49:37,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 491 transitions. [2018-11-18 11:49:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:49:37,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,045 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 11:49:37,045 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -479570073, now seen corresponding path program 1 times [2018-11-18 11:49:37,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,065 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 11:49:37,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,066 INFO L87 Difference]: Start difference. First operand 289 states and 491 transitions. Second operand 3 states. [2018-11-18 11:49:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,083 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2018-11-18 11:49:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:49:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,084 INFO L225 Difference]: With dead ends: 433 [2018-11-18 11:49:37,084 INFO L226 Difference]: Without dead ends: 295 [2018-11-18 11:49:37,085 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 11:49:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-18 11:49:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-11-18 11:49:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-18 11:49:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 491 transitions. [2018-11-18 11:49:37,091 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 491 transitions. Word has length 25 [2018-11-18 11:49:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,092 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 491 transitions. [2018-11-18 11:49:37,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,092 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 491 transitions. [2018-11-18 11:49:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:49:37,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,093 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 11:49:37,093 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1759433751, now seen corresponding path program 1 times [2018-11-18 11:49:37,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,112 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 11:49:37,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,113 INFO L87 Difference]: Start difference. First operand 293 states and 491 transitions. Second operand 3 states. [2018-11-18 11:49:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,141 INFO L93 Difference]: Finished difference Result 541 states and 921 transitions. [2018-11-18 11:49:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:49:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,143 INFO L225 Difference]: With dead ends: 541 [2018-11-18 11:49:37,143 INFO L226 Difference]: Without dead ends: 539 [2018-11-18 11:49:37,143 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 11:49:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-18 11:49:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 401. [2018-11-18 11:49:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-18 11:49:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions. [2018-11-18 11:49:37,153 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 25 [2018-11-18 11:49:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,153 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 663 transitions. [2018-11-18 11:49:37,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions. [2018-11-18 11:49:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:49:37,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,155 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 11:49:37,155 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1524416295, now seen corresponding path program 1 times [2018-11-18 11:49:37,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,177 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 11:49:37,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,179 INFO L87 Difference]: Start difference. First operand 401 states and 663 transitions. Second operand 3 states. [2018-11-18 11:49:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,208 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2018-11-18 11:49:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:49:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,210 INFO L225 Difference]: With dead ends: 949 [2018-11-18 11:49:37,210 INFO L226 Difference]: Without dead ends: 563 [2018-11-18 11:49:37,211 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 11:49:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-18 11:49:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2018-11-18 11:49:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-18 11:49:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2018-11-18 11:49:37,222 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 25 [2018-11-18 11:49:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,223 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2018-11-18 11:49:37,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2018-11-18 11:49:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:49:37,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,224 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 11:49:37,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1292342647, now seen corresponding path program 1 times [2018-11-18 11:49:37,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,249 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 11:49:37,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,250 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand 3 states. [2018-11-18 11:49:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,280 INFO L93 Difference]: Finished difference Result 841 states and 1373 transitions. [2018-11-18 11:49:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:49:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,282 INFO L225 Difference]: With dead ends: 841 [2018-11-18 11:49:37,282 INFO L226 Difference]: Without dead ends: 571 [2018-11-18 11:49:37,283 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 11:49:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-11-18 11:49:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2018-11-18 11:49:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-18 11:49:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 919 transitions. [2018-11-18 11:49:37,294 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 919 transitions. Word has length 26 [2018-11-18 11:49:37,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,294 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 919 transitions. [2018-11-18 11:49:37,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 919 transitions. [2018-11-18 11:49:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:49:37,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,295 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 11:49:37,295 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 12478969, now seen corresponding path program 1 times [2018-11-18 11:49:37,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,308 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 11:49:37,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,309 INFO L87 Difference]: Start difference. First operand 569 states and 919 transitions. Second operand 3 states. [2018-11-18 11:49:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,336 INFO L93 Difference]: Finished difference Result 1645 states and 2649 transitions. [2018-11-18 11:49:37,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:49:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,339 INFO L225 Difference]: With dead ends: 1645 [2018-11-18 11:49:37,339 INFO L226 Difference]: Without dead ends: 1099 [2018-11-18 11:49:37,340 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 11:49:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-11-18 11:49:37,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2018-11-18 11:49:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-18 11:49:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1735 transitions. [2018-11-18 11:49:37,360 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1735 transitions. Word has length 26 [2018-11-18 11:49:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,360 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1735 transitions. [2018-11-18 11:49:37,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1735 transitions. [2018-11-18 11:49:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:49:37,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,362 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 11:49:37,362 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1023596219, now seen corresponding path program 1 times [2018-11-18 11:49:37,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,376 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 11:49:37,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,377 INFO L87 Difference]: Start difference. First operand 1097 states and 1735 transitions. Second operand 3 states. [2018-11-18 11:49:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,401 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2018-11-18 11:49:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:49:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,404 INFO L225 Difference]: With dead ends: 1341 [2018-11-18 11:49:37,404 INFO L226 Difference]: Without dead ends: 1339 [2018-11-18 11:49:37,405 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 11:49:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-18 11:49:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1097. [2018-11-18 11:49:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-18 11:49:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1719 transitions. [2018-11-18 11:49:37,428 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1719 transitions. Word has length 26 [2018-11-18 11:49:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,428 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1719 transitions. [2018-11-18 11:49:37,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1719 transitions. [2018-11-18 11:49:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:49:37,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,430 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 11:49:37,430 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash 387062460, now seen corresponding path program 1 times [2018-11-18 11:49:37,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,443 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 11:49:37,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,444 INFO L87 Difference]: Start difference. First operand 1097 states and 1719 transitions. Second operand 3 states. [2018-11-18 11:49:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,474 INFO L93 Difference]: Finished difference Result 1981 states and 3161 transitions. [2018-11-18 11:49:37,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:49:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,478 INFO L225 Difference]: With dead ends: 1981 [2018-11-18 11:49:37,478 INFO L226 Difference]: Without dead ends: 1979 [2018-11-18 11:49:37,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 11:49:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-11-18 11:49:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1561. [2018-11-18 11:49:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-18 11:49:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2391 transitions. [2018-11-18 11:49:37,509 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2391 transitions. Word has length 27 [2018-11-18 11:49:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,510 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2391 transitions. [2018-11-18 11:49:37,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2391 transitions. [2018-11-18 11:49:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:49:37,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,512 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 11:49:37,512 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash -624054790, now seen corresponding path program 1 times [2018-11-18 11:49:37,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,536 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 11:49:37,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,537 INFO L87 Difference]: Start difference. First operand 1561 states and 2391 transitions. Second operand 3 states. [2018-11-18 11:49:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,572 INFO L93 Difference]: Finished difference Result 3677 states and 5657 transitions. [2018-11-18 11:49:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:49:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,576 INFO L225 Difference]: With dead ends: 3677 [2018-11-18 11:49:37,576 INFO L226 Difference]: Without dead ends: 2139 [2018-11-18 11:49:37,578 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 11:49:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-18 11:49:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2018-11-18 11:49:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-18 11:49:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3239 transitions. [2018-11-18 11:49:37,632 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3239 transitions. Word has length 27 [2018-11-18 11:49:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,632 INFO L480 AbstractCegarLoop]: Abstraction has 2137 states and 3239 transitions. [2018-11-18 11:49:37,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3239 transitions. [2018-11-18 11:49:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:49:37,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,634 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 11:49:37,634 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash -885750866, now seen corresponding path program 1 times [2018-11-18 11:49:37,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,656 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 11:49:37,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,657 INFO L87 Difference]: Start difference. First operand 2137 states and 3239 transitions. Second operand 3 states. [2018-11-18 11:49:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,689 INFO L93 Difference]: Finished difference Result 3229 states and 4889 transitions. [2018-11-18 11:49:37,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:49:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,693 INFO L225 Difference]: With dead ends: 3229 [2018-11-18 11:49:37,694 INFO L226 Difference]: Without dead ends: 2187 [2018-11-18 11:49:37,695 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 11:49:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-11-18 11:49:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2185. [2018-11-18 11:49:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2018-11-18 11:49:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3271 transitions. [2018-11-18 11:49:37,729 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3271 transitions. Word has length 28 [2018-11-18 11:49:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,730 INFO L480 AbstractCegarLoop]: Abstraction has 2185 states and 3271 transitions. [2018-11-18 11:49:37,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3271 transitions. [2018-11-18 11:49:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:49:37,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,732 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 11:49:37,732 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2129352752, now seen corresponding path program 1 times [2018-11-18 11:49:37,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,749 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 11:49:37,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,750 INFO L87 Difference]: Start difference. First operand 2185 states and 3271 transitions. Second operand 3 states. [2018-11-18 11:49:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,794 INFO L93 Difference]: Finished difference Result 3853 states and 5865 transitions. [2018-11-18 11:49:37,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:49:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,801 INFO L225 Difference]: With dead ends: 3853 [2018-11-18 11:49:37,801 INFO L226 Difference]: Without dead ends: 3851 [2018-11-18 11:49:37,802 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 11:49:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-18 11:49:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3145. [2018-11-18 11:49:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-18 11:49:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4583 transitions. [2018-11-18 11:49:37,850 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4583 transitions. Word has length 28 [2018-11-18 11:49:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:37,850 INFO L480 AbstractCegarLoop]: Abstraction has 3145 states and 4583 transitions. [2018-11-18 11:49:37,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4583 transitions. [2018-11-18 11:49:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:49:37,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:37,853 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 11:49:37,853 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:37,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:37,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1118235502, now seen corresponding path program 1 times [2018-11-18 11:49:37,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:37,876 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 11:49:37,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:37,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:37,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:37,877 INFO L87 Difference]: Start difference. First operand 3145 states and 4583 transitions. Second operand 3 states. [2018-11-18 11:49:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:37,931 INFO L93 Difference]: Finished difference Result 7309 states and 10665 transitions. [2018-11-18 11:49:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:37,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:49:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:37,939 INFO L225 Difference]: With dead ends: 7309 [2018-11-18 11:49:37,939 INFO L226 Difference]: Without dead ends: 4235 [2018-11-18 11:49:37,942 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 11:49:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-18 11:49:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4233. [2018-11-18 11:49:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4233 states. [2018-11-18 11:49:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 6087 transitions. [2018-11-18 11:49:38,015 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 6087 transitions. Word has length 28 [2018-11-18 11:49:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:38,016 INFO L480 AbstractCegarLoop]: Abstraction has 4233 states and 6087 transitions. [2018-11-18 11:49:38,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 6087 transitions. [2018-11-18 11:49:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:49:38,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:38,019 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 11:49:38,019 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:38,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1585640975, now seen corresponding path program 1 times [2018-11-18 11:49:38,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:38,036 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 11:49:38,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:38,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:38,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:38,037 INFO L87 Difference]: Start difference. First operand 4233 states and 6087 transitions. Second operand 3 states. [2018-11-18 11:49:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:38,096 INFO L93 Difference]: Finished difference Result 6349 states and 9097 transitions. [2018-11-18 11:49:38,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:38,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:49:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:38,106 INFO L225 Difference]: With dead ends: 6349 [2018-11-18 11:49:38,106 INFO L226 Difference]: Without dead ends: 4299 [2018-11-18 11:49:38,110 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 11:49:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2018-11-18 11:49:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2018-11-18 11:49:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2018-11-18 11:49:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6087 transitions. [2018-11-18 11:49:38,208 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6087 transitions. Word has length 29 [2018-11-18 11:49:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:38,208 INFO L480 AbstractCegarLoop]: Abstraction has 4297 states and 6087 transitions. [2018-11-18 11:49:38,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6087 transitions. [2018-11-18 11:49:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:49:38,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:38,211 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 11:49:38,211 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:38,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash 305777297, now seen corresponding path program 1 times [2018-11-18 11:49:38,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:38,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:38,224 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 11:49:38,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:38,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:38,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:38,225 INFO L87 Difference]: Start difference. First operand 4297 states and 6087 transitions. Second operand 3 states. [2018-11-18 11:49:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:38,295 INFO L93 Difference]: Finished difference Result 7437 states and 10697 transitions. [2018-11-18 11:49:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:38,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:49:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:38,308 INFO L225 Difference]: With dead ends: 7437 [2018-11-18 11:49:38,308 INFO L226 Difference]: Without dead ends: 7435 [2018-11-18 11:49:38,310 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 11:49:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-11-18 11:49:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6281. [2018-11-18 11:49:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2018-11-18 11:49:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8647 transitions. [2018-11-18 11:49:38,409 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8647 transitions. Word has length 29 [2018-11-18 11:49:38,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:38,409 INFO L480 AbstractCegarLoop]: Abstraction has 6281 states and 8647 transitions. [2018-11-18 11:49:38,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8647 transitions. [2018-11-18 11:49:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:49:38,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:38,414 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 11:49:38,414 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:38,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash -705339953, now seen corresponding path program 1 times [2018-11-18 11:49:38,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:38,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:38,432 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 11:49:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:38,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:38,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:38,433 INFO L87 Difference]: Start difference. First operand 6281 states and 8647 transitions. Second operand 3 states. [2018-11-18 11:49:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:38,525 INFO L93 Difference]: Finished difference Result 14477 states and 19913 transitions. [2018-11-18 11:49:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:38,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:49:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:38,537 INFO L225 Difference]: With dead ends: 14477 [2018-11-18 11:49:38,537 INFO L226 Difference]: Without dead ends: 8331 [2018-11-18 11:49:38,544 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 11:49:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2018-11-18 11:49:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 8329. [2018-11-18 11:49:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-18 11:49:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 11271 transitions. [2018-11-18 11:49:38,681 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 11271 transitions. Word has length 29 [2018-11-18 11:49:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:38,681 INFO L480 AbstractCegarLoop]: Abstraction has 8329 states and 11271 transitions. [2018-11-18 11:49:38,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 11271 transitions. [2018-11-18 11:49:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:49:38,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:38,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, 1, 1] [2018-11-18 11:49:38,686 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:38,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash 889377059, now seen corresponding path program 1 times [2018-11-18 11:49:38,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:38,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:38,708 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 11:49:38,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:38,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:38,709 INFO L87 Difference]: Start difference. First operand 8329 states and 11271 transitions. Second operand 3 states. [2018-11-18 11:49:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:38,810 INFO L93 Difference]: Finished difference Result 12493 states and 16841 transitions. [2018-11-18 11:49:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:38,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:49:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:38,820 INFO L225 Difference]: With dead ends: 12493 [2018-11-18 11:49:38,820 INFO L226 Difference]: Without dead ends: 8459 [2018-11-18 11:49:38,826 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 11:49:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2018-11-18 11:49:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8457. [2018-11-18 11:49:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8457 states. [2018-11-18 11:49:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8457 states to 8457 states and 11271 transitions. [2018-11-18 11:49:39,050 INFO L78 Accepts]: Start accepts. Automaton has 8457 states and 11271 transitions. Word has length 30 [2018-11-18 11:49:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:39,050 INFO L480 AbstractCegarLoop]: Abstraction has 8457 states and 11271 transitions. [2018-11-18 11:49:39,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8457 states and 11271 transitions. [2018-11-18 11:49:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:49:39,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:39,057 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 11:49:39,057 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:39,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash -390486619, now seen corresponding path program 1 times [2018-11-18 11:49:39,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:39,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:39,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:39,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:39,084 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 11:49:39,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:39,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:39,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:39,085 INFO L87 Difference]: Start difference. First operand 8457 states and 11271 transitions. Second operand 3 states. [2018-11-18 11:49:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:39,306 INFO L93 Difference]: Finished difference Result 14349 states and 19337 transitions. [2018-11-18 11:49:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:39,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:49:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:39,329 INFO L225 Difference]: With dead ends: 14349 [2018-11-18 11:49:39,329 INFO L226 Difference]: Without dead ends: 14347 [2018-11-18 11:49:39,334 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 11:49:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2018-11-18 11:49:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 12553. [2018-11-18 11:49:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12553 states. [2018-11-18 11:49:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 16263 transitions. [2018-11-18 11:49:39,579 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 16263 transitions. Word has length 30 [2018-11-18 11:49:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:39,579 INFO L480 AbstractCegarLoop]: Abstraction has 12553 states and 16263 transitions. [2018-11-18 11:49:39,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 16263 transitions. [2018-11-18 11:49:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:49:39,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:39,592 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 11:49:39,592 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:39,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1401603869, now seen corresponding path program 1 times [2018-11-18 11:49:39,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:39,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:39,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:39,613 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 11:49:39,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:39,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:39,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:39,614 INFO L87 Difference]: Start difference. First operand 12553 states and 16263 transitions. Second operand 3 states. [2018-11-18 11:49:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:39,879 INFO L93 Difference]: Finished difference Result 28685 states and 37001 transitions. [2018-11-18 11:49:39,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:39,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:49:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:39,903 INFO L225 Difference]: With dead ends: 28685 [2018-11-18 11:49:39,903 INFO L226 Difference]: Without dead ends: 16395 [2018-11-18 11:49:39,919 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 11:49:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2018-11-18 11:49:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16393. [2018-11-18 11:49:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16393 states. [2018-11-18 11:49:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 20743 transitions. [2018-11-18 11:49:40,255 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 20743 transitions. Word has length 30 [2018-11-18 11:49:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:40,256 INFO L480 AbstractCegarLoop]: Abstraction has 16393 states and 20743 transitions. [2018-11-18 11:49:40,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 20743 transitions. [2018-11-18 11:49:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:49:40,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:40,268 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 11:49:40,269 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:40,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 780032484, now seen corresponding path program 1 times [2018-11-18 11:49:40,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:40,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:40,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:40,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:40,292 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 11:49:40,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:40,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:40,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:40,293 INFO L87 Difference]: Start difference. First operand 16393 states and 20743 transitions. Second operand 3 states. [2018-11-18 11:49:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:40,520 INFO L93 Difference]: Finished difference Result 24589 states and 30985 transitions. [2018-11-18 11:49:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:40,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:49:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:40,543 INFO L225 Difference]: With dead ends: 24589 [2018-11-18 11:49:40,543 INFO L226 Difference]: Without dead ends: 16651 [2018-11-18 11:49:40,556 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 11:49:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2018-11-18 11:49:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 16649. [2018-11-18 11:49:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-18 11:49:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 20743 transitions. [2018-11-18 11:49:40,951 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 20743 transitions. Word has length 31 [2018-11-18 11:49:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:40,952 INFO L480 AbstractCegarLoop]: Abstraction has 16649 states and 20743 transitions. [2018-11-18 11:49:40,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 20743 transitions. [2018-11-18 11:49:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:49:40,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:40,964 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 11:49:40,965 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:40,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash -499831194, now seen corresponding path program 1 times [2018-11-18 11:49:40,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:40,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:40,981 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 11:49:40,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:40,982 INFO L87 Difference]: Start difference. First operand 16649 states and 20743 transitions. Second operand 3 states. [2018-11-18 11:49:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:41,330 INFO L93 Difference]: Finished difference Result 27661 states and 34569 transitions. [2018-11-18 11:49:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:41,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:49:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:41,371 INFO L225 Difference]: With dead ends: 27661 [2018-11-18 11:49:41,371 INFO L226 Difference]: Without dead ends: 27659 [2018-11-18 11:49:41,378 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 11:49:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27659 states. [2018-11-18 11:49:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27659 to 25097. [2018-11-18 11:49:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2018-11-18 11:49:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 30471 transitions. [2018-11-18 11:49:41,760 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 30471 transitions. Word has length 31 [2018-11-18 11:49:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:41,761 INFO L480 AbstractCegarLoop]: Abstraction has 25097 states and 30471 transitions. [2018-11-18 11:49:41,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 30471 transitions. [2018-11-18 11:49:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:49:41,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:41,773 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 11:49:41,773 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:41,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1510948444, now seen corresponding path program 1 times [2018-11-18 11:49:41,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:41,801 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 11:49:41,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:41,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:41,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:41,802 INFO L87 Difference]: Start difference. First operand 25097 states and 30471 transitions. Second operand 3 states. [2018-11-18 11:49:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:42,075 INFO L93 Difference]: Finished difference Result 56845 states and 68361 transitions. [2018-11-18 11:49:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:42,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:49:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:42,103 INFO L225 Difference]: With dead ends: 56845 [2018-11-18 11:49:42,103 INFO L226 Difference]: Without dead ends: 32267 [2018-11-18 11:49:42,124 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 11:49:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2018-11-18 11:49:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 32265. [2018-11-18 11:49:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32265 states. [2018-11-18 11:49:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32265 states to 32265 states and 37895 transitions. [2018-11-18 11:49:42,561 INFO L78 Accepts]: Start accepts. Automaton has 32265 states and 37895 transitions. Word has length 31 [2018-11-18 11:49:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:42,562 INFO L480 AbstractCegarLoop]: Abstraction has 32265 states and 37895 transitions. [2018-11-18 11:49:42,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 32265 states and 37895 transitions. [2018-11-18 11:49:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:49:42,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:42,575 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 11:49:42,575 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:42,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1685318296, now seen corresponding path program 1 times [2018-11-18 11:49:42,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:42,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:42,609 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 11:49:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:42,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:42,610 INFO L87 Difference]: Start difference. First operand 32265 states and 37895 transitions. Second operand 3 states. [2018-11-18 11:49:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:42,992 INFO L93 Difference]: Finished difference Result 48397 states and 56585 transitions. [2018-11-18 11:49:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:42,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:49:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:43,023 INFO L225 Difference]: With dead ends: 48397 [2018-11-18 11:49:43,023 INFO L226 Difference]: Without dead ends: 32779 [2018-11-18 11:49:43,037 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 11:49:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2018-11-18 11:49:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 32777. [2018-11-18 11:49:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32777 states. [2018-11-18 11:49:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 37895 transitions. [2018-11-18 11:49:43,444 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 37895 transitions. Word has length 32 [2018-11-18 11:49:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:43,444 INFO L480 AbstractCegarLoop]: Abstraction has 32777 states and 37895 transitions. [2018-11-18 11:49:43,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 37895 transitions. [2018-11-18 11:49:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:49:43,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:43,453 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 11:49:43,453 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:43,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash 405454618, now seen corresponding path program 1 times [2018-11-18 11:49:43,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:43,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:43,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:43,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:49:43,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:43,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:43,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:43,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:43,489 INFO L87 Difference]: Start difference. First operand 32777 states and 37895 transitions. Second operand 3 states. [2018-11-18 11:49:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:44,026 INFO L93 Difference]: Finished difference Result 53259 states and 60936 transitions. [2018-11-18 11:49:44,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:44,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:49:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:44,073 INFO L225 Difference]: With dead ends: 53259 [2018-11-18 11:49:44,073 INFO L226 Difference]: Without dead ends: 53257 [2018-11-18 11:49:44,081 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 11:49:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2018-11-18 11:49:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 50185. [2018-11-18 11:49:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50185 states. [2018-11-18 11:49:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50185 states to 50185 states and 56839 transitions. [2018-11-18 11:49:44,596 INFO L78 Accepts]: Start accepts. Automaton has 50185 states and 56839 transitions. Word has length 32 [2018-11-18 11:49:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:44,596 INFO L480 AbstractCegarLoop]: Abstraction has 50185 states and 56839 transitions. [2018-11-18 11:49:44,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 50185 states and 56839 transitions. [2018-11-18 11:49:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:49:44,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:49:44,620 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 11:49:44,621 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:49:44,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:49:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash -605662632, now seen corresponding path program 1 times [2018-11-18 11:49:44,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:49:44,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:49:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:44,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:49:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:49:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:49:44,645 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 11:49:44,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:49:44,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:49:44,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:49:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:49:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:49:44,646 INFO L87 Difference]: Start difference. First operand 50185 states and 56839 transitions. Second operand 3 states. [2018-11-18 11:49:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:49:45,384 INFO L93 Difference]: Finished difference Result 112649 states and 125447 transitions. [2018-11-18 11:49:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:49:45,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:49:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:49:45,385 INFO L225 Difference]: With dead ends: 112649 [2018-11-18 11:49:45,385 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:49:45,430 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 11:49:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:49:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:49:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:49:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:49:45,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-18 11:49:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:49:45,431 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:49:45,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:49:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:49:45,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:49:45,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:49:45,458 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 11:49:45,458 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:49:45,458 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:49:45,458 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:49:45,458 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:49:45,458 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:49:45,458 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-18 11:49:45,458 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-18 11:49:45,458 INFO L425 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L421 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-18 11:49:45,459 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L428 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,460 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 11:49:45,461 INFO L428 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-18 11:49:45,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:49:45 BoogieIcfgContainer [2018-11-18 11:49:45,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:49:45,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:49:45,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:49:45,467 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:49:45,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:49:36" (3/4) ... [2018-11-18 11:49:45,473 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:49:45,479 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:49:45,480 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:49:45,484 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 11:49:45,484 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 11:49:45,484 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:49:45,533 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c81d762b-fa57-48ac-85c3-8aa53c262662/bin-2019/uautomizer/witness.graphml [2018-11-18 11:49:45,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:49:45,534 INFO L168 Benchmark]: Toolchain (without parser) took 9679.15 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 913.8 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -365.3 MB). Peak memory consumption was 548.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:45,535 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:49:45,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.18 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:45,535 INFO L168 Benchmark]: Boogie Preprocessor took 24.06 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:49:45,536 INFO L168 Benchmark]: RCFGBuilder took 246.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:45,536 INFO L168 Benchmark]: TraceAbstraction took 9167.19 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 774.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -232.4 MB). Peak memory consumption was 542.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:45,536 INFO L168 Benchmark]: Witness Printer took 66.75 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:49:45,537 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.18 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.06 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 246.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9167.19 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 774.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -232.4 MB). Peak memory consumption was 542.5 MB. Max. memory is 11.5 GB. * Witness Printer took 66.75 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 1433 SDslu, 1995 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50185occurred in iteration=30, 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: 3.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 10271 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 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.5s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 42564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...