./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/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 5107685577f81a5867811396b2c0a05eb5630c95 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 14:12:36,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:12:36,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:12:36,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:12:36,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:12:36,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:12:36,919 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:12:36,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:12:36,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:12:36,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:12:36,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:12:36,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:12:36,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:12:36,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:12:36,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:12:36,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:12:36,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:12:36,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:12:36,926 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:12:36,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:12:36,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:12:36,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:12:36,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:12:36,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:12:36,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:12:36,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:12:36,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:12:36,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:12:36,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:12:36,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:12:36,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:12:36,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:12:36,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:12:36,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:12:36,933 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:12:36,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:12:36,934 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 14:12:36,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:12:36,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:12:36,942 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:12:36,942 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:12:36,942 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 14:12:36,942 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 14:12:36,942 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 14:12:36,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 14:12:36,943 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 14:12:36,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:12:36,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:12:36,945 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:12:36,945 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:12:36,945 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 14:12:36,945 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 14:12:36,945 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:12:36,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 14:12:36,945 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_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-12-09 14:12:36,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:12:36,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:12:36,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:12:36,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:12:36,972 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:12:36,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 14:12:37,005 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/data/25959ec6e/eee5f83ca1484898bc0fd2a46413edbd/FLAGb39cddc94 [2018-12-09 14:12:37,400 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:12:37,400 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 14:12:37,404 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/data/25959ec6e/eee5f83ca1484898bc0fd2a46413edbd/FLAGb39cddc94 [2018-12-09 14:12:37,412 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/data/25959ec6e/eee5f83ca1484898bc0fd2a46413edbd [2018-12-09 14:12:37,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:12:37,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 14:12:37,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:12:37,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:12:37,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:12:37,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37, skipping insertion in model container [2018-12-09 14:12:37,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:12:37,433 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:12:37,520 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:12:37,522 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:12:37,536 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:12:37,544 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:12:37,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37 WrapperNode [2018-12-09 14:12:37,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:12:37,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 14:12:37,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 14:12:37,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 14:12:37,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 14:12:37,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:12:37,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:12:37,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:12:37,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... [2018-12-09 14:12:37,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:12:37,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:12:37,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:12:37,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:12:37,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:12:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 14:12:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 14:12:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:12:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:12:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 14:12:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 14:12:37,770 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:12:37,770 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 14:12:37,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:12:37 BoogieIcfgContainer [2018-12-09 14:12:37,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:12:37,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:12:37,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:12:37,772 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:12:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:12:37" (1/3) ... [2018-12-09 14:12:37,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ee7c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:12:37, skipping insertion in model container [2018-12-09 14:12:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:12:37" (2/3) ... [2018-12-09 14:12:37,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ee7c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:12:37, skipping insertion in model container [2018-12-09 14:12:37,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:12:37" (3/3) ... [2018-12-09 14:12:37,774 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 14:12:37,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:12:37,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 14:12:37,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 14:12:37,809 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 14:12:37,810 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:12:37,810 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 14:12:37,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:12:37,810 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:12:37,810 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:12:37,810 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:12:37,810 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:12:37,810 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:12:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-12-09 14:12:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 14:12:37,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:37,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:37,826 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:37,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-12-09 14:12:37,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:37,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:37,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:37,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:37,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:37,944 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-12-09 14:12:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:37,973 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-12-09 14:12:37,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:37,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 14:12:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:37,981 INFO L225 Difference]: With dead ends: 81 [2018-12-09 14:12:37,981 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 14:12:37,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 14:12:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-12-09 14:12:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 14:12:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-12-09 14:12:38,006 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-12-09 14:12:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,006 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-12-09 14:12:38,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-12-09 14:12:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 14:12:38,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,007 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,007 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-12-09 14:12:38,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,036 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-12-09 14:12:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,054 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-12-09 14:12:38,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 14:12:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,055 INFO L225 Difference]: With dead ends: 107 [2018-12-09 14:12:38,055 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 14:12:38,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 14:12:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-09 14:12:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 14:12:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-12-09 14:12:38,060 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-12-09 14:12:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,060 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-12-09 14:12:38,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-12-09 14:12:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 14:12:38,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,061 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-12-09 14:12:38,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,088 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-12-09 14:12:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,102 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-12-09 14:12:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 14:12:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,102 INFO L225 Difference]: With dead ends: 99 [2018-12-09 14:12:38,102 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 14:12:38,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 14:12:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-09 14:12:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 14:12:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-12-09 14:12:38,107 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-12-09 14:12:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,107 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-12-09 14:12:38,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-12-09 14:12:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 14:12:38,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,107 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-12-09 14:12:38,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,127 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-12-09 14:12:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,140 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-12-09 14:12:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 14:12:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,141 INFO L225 Difference]: With dead ends: 124 [2018-12-09 14:12:38,141 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 14:12:38,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 14:12:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-12-09 14:12:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 14:12:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-12-09 14:12:38,146 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-12-09 14:12:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,146 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-12-09 14:12:38,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-12-09 14:12:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 14:12:38,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,147 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-12-09 14:12:38,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,171 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-12-09 14:12:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,181 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-12-09 14:12:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 14:12:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,182 INFO L225 Difference]: With dead ends: 204 [2018-12-09 14:12:38,182 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 14:12:38,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 14:12:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-09 14:12:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 14:12:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-12-09 14:12:38,188 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-12-09 14:12:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,188 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-12-09 14:12:38,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-12-09 14:12:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:12:38,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,188 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-12-09 14:12:38,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,207 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-12-09 14:12:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,215 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-12-09 14:12:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:12:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,216 INFO L225 Difference]: With dead ends: 183 [2018-12-09 14:12:38,216 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 14:12:38,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 14:12:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-09 14:12:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 14:12:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-12-09 14:12:38,221 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-12-09 14:12:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,221 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-12-09 14:12:38,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-12-09 14:12:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:12:38,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,222 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-12-09 14:12:38,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,243 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-12-09 14:12:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,255 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-12-09 14:12:38,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:12:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,257 INFO L225 Difference]: With dead ends: 228 [2018-12-09 14:12:38,257 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 14:12:38,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 14:12:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-12-09 14:12:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-09 14:12:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-12-09 14:12:38,263 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-12-09 14:12:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,263 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-12-09 14:12:38,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-12-09 14:12:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:12:38,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,264 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-12-09 14:12:38,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,279 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-12-09 14:12:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,292 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-12-09 14:12:38,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:12:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,294 INFO L225 Difference]: With dead ends: 392 [2018-12-09 14:12:38,294 INFO L226 Difference]: Without dead ends: 234 [2018-12-09 14:12:38,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-09 14:12:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-12-09 14:12:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 14:12:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-12-09 14:12:38,304 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-12-09 14:12:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,304 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-12-09 14:12:38,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-12-09 14:12:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 14:12:38,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,305 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-12-09 14:12:38,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,322 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-12-09 14:12:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,335 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-12-09 14:12:38,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 14:12:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,336 INFO L225 Difference]: With dead ends: 348 [2018-12-09 14:12:38,336 INFO L226 Difference]: Without dead ends: 238 [2018-12-09 14:12:38,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-09 14:12:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-12-09 14:12:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-09 14:12:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-12-09 14:12:38,346 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-12-09 14:12:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,346 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-12-09 14:12:38,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-12-09 14:12:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 14:12:38,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,347 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-12-09 14:12:38,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,363 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-12-09 14:12:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,380 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-12-09 14:12:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 14:12:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,381 INFO L225 Difference]: With dead ends: 428 [2018-12-09 14:12:38,382 INFO L226 Difference]: Without dead ends: 426 [2018-12-09 14:12:38,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-09 14:12:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-12-09 14:12:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-09 14:12:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-12-09 14:12:38,391 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-12-09 14:12:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,391 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-12-09 14:12:38,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-12-09 14:12:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 14:12:38,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,393 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-12-09 14:12:38,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,408 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-12-09 14:12:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,425 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-12-09 14:12:38,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 14:12:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,426 INFO L225 Difference]: With dead ends: 764 [2018-12-09 14:12:38,426 INFO L226 Difference]: Without dead ends: 450 [2018-12-09 14:12:38,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-09 14:12:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-12-09 14:12:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-09 14:12:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-12-09 14:12:38,441 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-12-09 14:12:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,441 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-12-09 14:12:38,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-12-09 14:12:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 14:12:38,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,443 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-12-09 14:12:38,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,461 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-12-09 14:12:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,482 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-12-09 14:12:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 14:12:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,484 INFO L225 Difference]: With dead ends: 672 [2018-12-09 14:12:38,484 INFO L226 Difference]: Without dead ends: 458 [2018-12-09 14:12:38,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-09 14:12:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-12-09 14:12:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-09 14:12:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-12-09 14:12:38,497 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-12-09 14:12:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,497 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-12-09 14:12:38,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-12-09 14:12:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 14:12:38,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,498 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-12-09 14:12:38,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,509 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-12-09 14:12:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,530 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-12-09 14:12:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 14:12:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,533 INFO L225 Difference]: With dead ends: 812 [2018-12-09 14:12:38,533 INFO L226 Difference]: Without dead ends: 810 [2018-12-09 14:12:38,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-09 14:12:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-12-09 14:12:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-09 14:12:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-12-09 14:12:38,550 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-12-09 14:12:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,550 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-12-09 14:12:38,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-12-09 14:12:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 14:12:38,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,552 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-12-09 14:12:38,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,562 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-12-09 14:12:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,591 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-12-09 14:12:38,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 14:12:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,595 INFO L225 Difference]: With dead ends: 1500 [2018-12-09 14:12:38,595 INFO L226 Difference]: Without dead ends: 874 [2018-12-09 14:12:38,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-09 14:12:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-12-09 14:12:38,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-09 14:12:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-12-09 14:12:38,622 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-12-09 14:12:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,623 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-12-09 14:12:38,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-12-09 14:12:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 14:12:38,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,624 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-12-09 14:12:38,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,640 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-12-09 14:12:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,663 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-12-09 14:12:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 14:12:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,666 INFO L225 Difference]: With dead ends: 1308 [2018-12-09 14:12:38,666 INFO L226 Difference]: Without dead ends: 890 [2018-12-09 14:12:38,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-12-09 14:12:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-12-09 14:12:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-09 14:12:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-12-09 14:12:38,694 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-12-09 14:12:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,694 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-12-09 14:12:38,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-12-09 14:12:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 14:12:38,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,696 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,696 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-12-09 14:12:38,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,712 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-12-09 14:12:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,746 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-12-09 14:12:38,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 14:12:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,751 INFO L225 Difference]: With dead ends: 1548 [2018-12-09 14:12:38,751 INFO L226 Difference]: Without dead ends: 1546 [2018-12-09 14:12:38,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-09 14:12:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-12-09 14:12:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-12-09 14:12:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-12-09 14:12:38,789 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-12-09 14:12:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-12-09 14:12:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-12-09 14:12:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 14:12:38,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,791 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-12-09 14:12:38,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,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-12-09 14:12:38,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,802 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-12-09 14:12:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,836 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-12-09 14:12:38,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 14:12:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,839 INFO L225 Difference]: With dead ends: 2956 [2018-12-09 14:12:38,839 INFO L226 Difference]: Without dead ends: 1706 [2018-12-09 14:12:38,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-12-09 14:12:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-12-09 14:12:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-12-09 14:12:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-12-09 14:12:38,872 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-12-09 14:12:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,872 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-12-09 14:12:38,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-12-09 14:12:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 14:12:38,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,874 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,874 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-12-09 14:12:38,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,884 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-12-09 14:12:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:38,923 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-12-09 14:12:38,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:38,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 14:12:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:38,928 INFO L225 Difference]: With dead ends: 2556 [2018-12-09 14:12:38,929 INFO L226 Difference]: Without dead ends: 1738 [2018-12-09 14:12:38,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-09 14:12:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-12-09 14:12:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-12-09 14:12:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-12-09 14:12:38,975 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-12-09 14:12:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:38,976 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-12-09 14:12:38,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-12-09 14:12:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 14:12:38,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:38,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:38,978 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:38,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:38,978 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-12-09 14:12:38,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:38,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:38,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:38,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:38,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:38,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:38,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:38,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:38,992 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-12-09 14:12:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:39,065 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-12-09 14:12:39,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:39,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 14:12:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:39,073 INFO L225 Difference]: With dead ends: 2956 [2018-12-09 14:12:39,073 INFO L226 Difference]: Without dead ends: 2954 [2018-12-09 14:12:39,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-12-09 14:12:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-12-09 14:12:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-12-09 14:12:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-12-09 14:12:39,126 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-12-09 14:12:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:39,126 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-12-09 14:12:39,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-12-09 14:12:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 14:12:39,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:39,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:39,128 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:39,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-12-09 14:12:39,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:39,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:39,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:39,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:39,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,143 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-12-09 14:12:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:39,185 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-12-09 14:12:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:39,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 14:12:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:39,190 INFO L225 Difference]: With dead ends: 5836 [2018-12-09 14:12:39,190 INFO L226 Difference]: Without dead ends: 3338 [2018-12-09 14:12:39,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-09 14:12:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-12-09 14:12:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-09 14:12:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-12-09 14:12:39,245 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-12-09 14:12:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:39,245 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-12-09 14:12:39,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-12-09 14:12:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 14:12:39,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:39,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:39,247 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:39,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-12-09 14:12:39,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:39,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:39,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:39,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:39,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:39,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:39,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,256 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-12-09 14:12:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:39,303 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-12-09 14:12:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:39,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 14:12:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:39,309 INFO L225 Difference]: With dead ends: 5004 [2018-12-09 14:12:39,309 INFO L226 Difference]: Without dead ends: 3402 [2018-12-09 14:12:39,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-12-09 14:12:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-12-09 14:12:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-12-09 14:12:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-12-09 14:12:39,362 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-12-09 14:12:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:39,362 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-12-09 14:12:39,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-12-09 14:12:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 14:12:39,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:39,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:39,364 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:39,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-12-09 14:12:39,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:39,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:39,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:39,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:39,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:39,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,375 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-12-09 14:12:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:39,441 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-12-09 14:12:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:39,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 14:12:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:39,452 INFO L225 Difference]: With dead ends: 9804 [2018-12-09 14:12:39,453 INFO L226 Difference]: Without dead ends: 6538 [2018-12-09 14:12:39,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-12-09 14:12:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-12-09 14:12:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-12-09 14:12:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-12-09 14:12:39,550 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-12-09 14:12:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:39,550 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-12-09 14:12:39,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-12-09 14:12:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 14:12:39,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:39,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:39,553 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:39,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-12-09 14:12:39,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:39,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:39,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,562 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-12-09 14:12:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:39,652 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-12-09 14:12:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:39,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 14:12:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:39,661 INFO L225 Difference]: With dead ends: 7052 [2018-12-09 14:12:39,661 INFO L226 Difference]: Without dead ends: 7050 [2018-12-09 14:12:39,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-12-09 14:12:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-12-09 14:12:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-12-09 14:12:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-12-09 14:12:39,801 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-12-09 14:12:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:39,801 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-12-09 14:12:39,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-12-09 14:12:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 14:12:39,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:39,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:39,807 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:39,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-12-09 14:12:39,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:39,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:39,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:39,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:39,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:39,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,820 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-12-09 14:12:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:39,910 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-12-09 14:12:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:39,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 14:12:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:39,919 INFO L225 Difference]: With dead ends: 10634 [2018-12-09 14:12:39,919 INFO L226 Difference]: Without dead ends: 10632 [2018-12-09 14:12:39,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-12-09 14:12:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-12-09 14:12:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-12-09 14:12:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-12-09 14:12:40,025 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-12-09 14:12:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:40,026 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-12-09 14:12:40,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-12-09 14:12:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 14:12:40,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:12:40,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:12:40,030 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:12:40,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:12:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-12-09 14:12:40,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 14:12:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 14:12:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:12:40,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:12:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:12:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:12:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:12:40,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:12:40,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:12:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:12:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:40,044 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-12-09 14:12:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:12:40,195 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-12-09 14:12:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:12:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 14:12:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:12:40,196 INFO L225 Difference]: With dead ends: 22664 [2018-12-09 14:12:40,196 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 14:12:40,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:12:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 14:12:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 14:12:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 14:12:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 14:12:40,215 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-09 14:12:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:12:40,215 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 14:12:40,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:12:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 14:12:40,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 14:12:40,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 14:12:40,239 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 14:12:40,239 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-09 14:12:40,239 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,240 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,241 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 14:12:40,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:12:40 BoogieIcfgContainer [2018-12-09 14:12:40,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:12:40,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:12:40,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:12:40,245 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:12:40,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:12:37" (3/4) ... [2018-12-09 14:12:40,248 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 14:12:40,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 14:12:40,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 14:12:40,256 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 14:12:40,257 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 14:12:40,257 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 14:12:40,291 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c39c0fc8-6762-4b9b-b72b-8203b5fd9c08/bin-2019/uautomizer/witness.graphml [2018-12-09 14:12:40,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:12:40,292 INFO L168 Benchmark]: Toolchain (without parser) took 2878.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.4 MB). Free memory was 961.4 MB in the beginning and 993.7 MB in the end (delta: -32.4 MB). Peak memory consumption was 311.1 MB. Max. memory is 11.5 GB. [2018-12-09 14:12:40,293 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:12:40,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.72 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 14:12:40,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.97 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:12:40,293 INFO L168 Benchmark]: Boogie Preprocessor took 46.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-09 14:12:40,293 INFO L168 Benchmark]: RCFGBuilder took 166.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-12-09 14:12:40,293 INFO L168 Benchmark]: TraceAbstraction took 2474.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 993.7 MB in the end (delta: 125.8 MB). Peak memory consumption was 317.2 MB. Max. memory is 11.5 GB. [2018-12-09 14:12:40,294 INFO L168 Benchmark]: Witness Printer took 45.93 ms. Allocated memory is still 1.4 GB. Free memory is still 993.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:12:40,295 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.72 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.97 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2474.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 993.7 MB in the end (delta: 125.8 MB). Peak memory consumption was 317.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.93 ms. Allocated memory is still 1.4 GB. Free memory is still 993.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...