./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_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/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_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/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-02 08:24:19,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:24:19,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:24:19,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:24:19,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:24:19,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:24:19,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:24:19,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:24:19,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:24:19,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:24:19,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:24:19,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:24:19,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:24:19,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:24:19,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:24:19,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:24:19,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:24:19,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:24:19,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:24:19,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:24:19,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:24:19,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:24:19,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:24:19,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:24:19,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:24:19,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:24:19,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:24:19,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:24:19,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:24:19,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:24:19,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:24:19,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:24:19,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:24:19,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:24:19,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:24:19,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:24:19,223 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 08:24:19,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:24:19,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:24:19,230 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:24:19,230 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:24:19,231 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 08:24:19,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:24:19,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:24:19,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:24:19,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:24:19,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:24:19,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:24:19,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:24:19,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 08:24:19,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:24:19,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:24:19,233 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_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/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-02 08:24:19,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:24:19,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:24:19,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:24:19,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:24:19,264 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:24:19,264 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 08:24:19,306 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/data/67f8c60b3/eb3a0b583e8546229928151649c0a37d/FLAG4f7a7a460 [2018-12-02 08:24:19,685 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:24:19,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 08:24:19,690 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/data/67f8c60b3/eb3a0b583e8546229928151649c0a37d/FLAG4f7a7a460 [2018-12-02 08:24:19,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/data/67f8c60b3/eb3a0b583e8546229928151649c0a37d [2018-12-02 08:24:19,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:24:19,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:24:19,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:24:19,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:24:19,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:24:19,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19, skipping insertion in model container [2018-12-02 08:24:19,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:24:19,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:24:19,815 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:24:19,817 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:24:19,834 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:24:19,843 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:24:19,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19 WrapperNode [2018-12-02 08:24:19,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:24:19,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:24:19,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:24:19,844 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:24:19,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:24:19,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:24:19,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:24:19,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:24:19,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... [2018-12-02 08:24:19,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:24:19,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:24:19,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:24:19,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:24:19,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/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-02 08:24:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:24:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:24:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:24:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:24:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:24:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:24:20,067 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:24:20,067 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 08:24:20,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:20 BoogieIcfgContainer [2018-12-02 08:24:20,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:24:20,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:24:20,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:24:20,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:24:20,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:24:19" (1/3) ... [2018-12-02 08:24:20,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798c0a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:24:20, skipping insertion in model container [2018-12-02 08:24:20,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:24:19" (2/3) ... [2018-12-02 08:24:20,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798c0a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:24:20, skipping insertion in model container [2018-12-02 08:24:20,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:20" (3/3) ... [2018-12-02 08:24:20,072 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 08:24:20,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:24:20,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 08:24:20,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 08:24:20,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:24:20,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:24:20,107 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:24:20,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:24:20,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:24:20,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:24:20,107 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:24:20,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:24:20,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:24:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-12-02 08:24:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 08:24:20,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,123 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-02 08:24:20,124 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-12-02 08:24:20,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,222 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-02 08:24:20,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,236 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-12-02 08:24:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,267 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-12-02 08:24:20,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 08:24:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,274 INFO L225 Difference]: With dead ends: 81 [2018-12-02 08:24:20,275 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 08:24:20,276 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-02 08:24:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 08:24:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-12-02 08:24:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 08:24:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-12-02 08:24:20,300 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-12-02 08:24:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-12-02 08:24:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-12-02 08:24:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 08:24:20,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,300 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-02 08:24:20,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-12-02 08:24:20,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,332 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-02 08:24:20,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,334 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-12-02 08:24:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,354 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-12-02 08:24:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 08:24:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,355 INFO L225 Difference]: With dead ends: 107 [2018-12-02 08:24:20,355 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 08:24:20,356 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-02 08:24:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 08:24:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-02 08:24:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 08:24:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-12-02 08:24:20,360 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-12-02 08:24:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,360 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-12-02 08:24:20,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-12-02 08:24:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:24:20,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,361 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-02 08:24:20,361 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-12-02 08:24:20,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,382 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-02 08:24:20,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,383 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-12-02 08:24:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,400 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-12-02 08:24:20,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 08:24:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,400 INFO L225 Difference]: With dead ends: 99 [2018-12-02 08:24:20,400 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 08:24:20,401 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-02 08:24:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 08:24:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-02 08:24:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 08:24:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-12-02 08:24:20,405 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-12-02 08:24:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,405 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-12-02 08:24:20,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-12-02 08:24:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:24:20,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,405 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-02 08:24:20,405 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-12-02 08:24:20,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,426 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-02 08:24:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,427 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-12-02 08:24:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,437 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-12-02 08:24:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 08:24:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,438 INFO L225 Difference]: With dead ends: 124 [2018-12-02 08:24:20,438 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 08:24:20,438 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-02 08:24:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 08:24:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-12-02 08:24:20,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 08:24:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-12-02 08:24:20,443 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-12-02 08:24:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,443 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-12-02 08:24:20,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-12-02 08:24:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:24:20,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,444 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-02 08:24:20,444 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-12-02 08:24:20,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,461 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-02 08:24:20,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,462 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-12-02 08:24:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,477 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-12-02 08:24:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 08:24:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,478 INFO L225 Difference]: With dead ends: 204 [2018-12-02 08:24:20,478 INFO L226 Difference]: Without dead ends: 124 [2018-12-02 08:24:20,478 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-02 08:24:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-02 08:24:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-02 08:24:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 08:24:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-12-02 08:24:20,483 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-12-02 08:24:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,484 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-12-02 08:24:20,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-12-02 08:24:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:24:20,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,484 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-02 08:24:20,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-12-02 08:24:20,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,498 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-02 08:24:20,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,499 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-12-02 08:24:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,513 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-12-02 08:24:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:24:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,514 INFO L225 Difference]: With dead ends: 183 [2018-12-02 08:24:20,514 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 08:24:20,514 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-02 08:24:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 08:24:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-02 08:24:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-02 08:24:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-12-02 08:24:20,521 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-12-02 08:24:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,521 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-12-02 08:24:20,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-12-02 08:24:20,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:24:20,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,522 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-02 08:24:20,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-12-02 08:24:20,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,542 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-02 08:24:20,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,543 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-12-02 08:24:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,555 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-12-02 08:24:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:24:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,557 INFO L225 Difference]: With dead ends: 228 [2018-12-02 08:24:20,557 INFO L226 Difference]: Without dead ends: 226 [2018-12-02 08:24:20,557 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-02 08:24:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-02 08:24:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-12-02 08:24:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-02 08:24:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-12-02 08:24:20,565 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-12-02 08:24:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,566 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-12-02 08:24:20,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-12-02 08:24:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:24:20,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,567 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-02 08:24:20,567 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-12-02 08:24:20,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,581 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-02 08:24:20,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,582 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-12-02 08:24:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,597 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-12-02 08:24:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:24:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,598 INFO L225 Difference]: With dead ends: 392 [2018-12-02 08:24:20,599 INFO L226 Difference]: Without dead ends: 234 [2018-12-02 08:24:20,599 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-02 08:24:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-02 08:24:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-12-02 08:24:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-02 08:24:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-12-02 08:24:20,606 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-12-02 08:24:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,607 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-12-02 08:24:20,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-12-02 08:24:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 08:24:20,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,607 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-02 08:24:20,607 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-12-02 08:24:20,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,618 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-02 08:24:20,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,619 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-12-02 08:24:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,628 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-12-02 08:24:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 08:24:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,629 INFO L225 Difference]: With dead ends: 348 [2018-12-02 08:24:20,629 INFO L226 Difference]: Without dead ends: 238 [2018-12-02 08:24:20,630 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-02 08:24:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-02 08:24:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-12-02 08:24:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-02 08:24:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-12-02 08:24:20,635 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-12-02 08:24:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,635 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-12-02 08:24:20,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-12-02 08:24:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 08:24:20,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,636 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-02 08:24:20,636 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-12-02 08:24:20,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,653 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-02 08:24:20,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,654 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-12-02 08:24:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,664 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-12-02 08:24:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 08:24:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,666 INFO L225 Difference]: With dead ends: 428 [2018-12-02 08:24:20,666 INFO L226 Difference]: Without dead ends: 426 [2018-12-02 08:24:20,666 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-02 08:24:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-02 08:24:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-12-02 08:24:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-02 08:24:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-12-02 08:24:20,676 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-12-02 08:24:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,676 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-12-02 08:24:20,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-12-02 08:24:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 08:24:20,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,677 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-02 08:24:20,678 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-12-02 08:24:20,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,693 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-02 08:24:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,694 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-12-02 08:24:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,714 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-12-02 08:24:20,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 08:24:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,716 INFO L225 Difference]: With dead ends: 764 [2018-12-02 08:24:20,716 INFO L226 Difference]: Without dead ends: 450 [2018-12-02 08:24:20,717 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-02 08:24:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-02 08:24:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-12-02 08:24:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-02 08:24:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-12-02 08:24:20,731 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-12-02 08:24:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,731 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-12-02 08:24:20,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-12-02 08:24:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:24:20,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,732 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-02 08:24:20,732 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-12-02 08:24:20,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,750 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-02 08:24:20,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,751 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-12-02 08:24:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,765 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-12-02 08:24:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 08:24:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,767 INFO L225 Difference]: With dead ends: 672 [2018-12-02 08:24:20,767 INFO L226 Difference]: Without dead ends: 458 [2018-12-02 08:24:20,767 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-02 08:24:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-02 08:24:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-12-02 08:24:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-02 08:24:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-12-02 08:24:20,779 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-12-02 08:24:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,779 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-12-02 08:24:20,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-12-02 08:24:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:24:20,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,780 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-02 08:24:20,780 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-12-02 08:24:20,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,797 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-02 08:24:20,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,798 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-12-02 08:24:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,822 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-12-02 08:24:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 08:24:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,825 INFO L225 Difference]: With dead ends: 812 [2018-12-02 08:24:20,825 INFO L226 Difference]: Without dead ends: 810 [2018-12-02 08:24:20,826 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-02 08:24:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-02 08:24:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-12-02 08:24:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-02 08:24:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-12-02 08:24:20,846 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-12-02 08:24:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,846 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-12-02 08:24:20,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-12-02 08:24:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 08:24:20,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,848 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-02 08:24:20,848 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-12-02 08:24:20,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,864 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-02 08:24:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,865 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-12-02 08:24:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,895 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-12-02 08:24:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 08:24:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,898 INFO L225 Difference]: With dead ends: 1500 [2018-12-02 08:24:20,899 INFO L226 Difference]: Without dead ends: 874 [2018-12-02 08:24:20,900 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-02 08:24:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-02 08:24:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-12-02 08:24:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-02 08:24:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-12-02 08:24:20,927 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-12-02 08:24:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,928 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-12-02 08:24:20,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-12-02 08:24:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 08:24:20,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:20,929 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-02 08:24:20,929 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:20,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-12-02 08:24:20,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:20,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:20,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:20,942 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-02 08:24:20,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:20,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:20,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:20,943 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-12-02 08:24:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:20,966 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-12-02 08:24:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:20,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 08:24:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:20,969 INFO L225 Difference]: With dead ends: 1308 [2018-12-02 08:24:20,969 INFO L226 Difference]: Without dead ends: 890 [2018-12-02 08:24:20,970 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-02 08:24:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-12-02 08:24:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-12-02 08:24:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 08:24:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-12-02 08:24:20,998 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-12-02 08:24:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:20,998 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-12-02 08:24:20,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-12-02 08:24:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 08:24:20,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,000 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-02 08:24:21,000 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-12-02 08:24:21,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,018 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-02 08:24:21,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,019 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-12-02 08:24:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,054 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-12-02 08:24:21,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 08:24:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,058 INFO L225 Difference]: With dead ends: 1548 [2018-12-02 08:24:21,058 INFO L226 Difference]: Without dead ends: 1546 [2018-12-02 08:24:21,059 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-02 08:24:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-02 08:24:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-12-02 08:24:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-12-02 08:24:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-12-02 08:24:21,086 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-12-02 08:24:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,086 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-12-02 08:24:21,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-12-02 08:24:21,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 08:24:21,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,088 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-02 08:24:21,088 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,088 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-12-02 08:24:21,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,098 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-02 08:24:21,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,099 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-12-02 08:24:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,144 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-12-02 08:24:21,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 08:24:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,147 INFO L225 Difference]: With dead ends: 2956 [2018-12-02 08:24:21,147 INFO L226 Difference]: Without dead ends: 1706 [2018-12-02 08:24:21,149 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-02 08:24:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-12-02 08:24:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-12-02 08:24:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-12-02 08:24:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-12-02 08:24:21,190 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-12-02 08:24:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,190 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-12-02 08:24:21,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-12-02 08:24:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 08:24:21,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,191 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-02 08:24:21,191 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-12-02 08:24:21,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,200 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-02 08:24:21,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,200 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-12-02 08:24:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,227 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-12-02 08:24:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 08:24:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,232 INFO L225 Difference]: With dead ends: 2556 [2018-12-02 08:24:21,232 INFO L226 Difference]: Without dead ends: 1738 [2018-12-02 08:24:21,233 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-02 08:24:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-02 08:24:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-12-02 08:24:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-12-02 08:24:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-12-02 08:24:21,273 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-12-02 08:24:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,273 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-12-02 08:24:21,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-12-02 08:24:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 08:24:21,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,274 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-02 08:24:21,275 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,275 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-12-02 08:24:21,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,289 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-02 08:24:21,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,290 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-12-02 08:24:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,340 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-12-02 08:24:21,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 08:24:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,344 INFO L225 Difference]: With dead ends: 2956 [2018-12-02 08:24:21,345 INFO L226 Difference]: Without dead ends: 2954 [2018-12-02 08:24:21,345 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-02 08:24:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-12-02 08:24:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-12-02 08:24:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-12-02 08:24:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-12-02 08:24:21,385 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-12-02 08:24:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,386 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-12-02 08:24:21,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-12-02 08:24:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 08:24:21,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,388 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-02 08:24:21,388 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-12-02 08:24:21,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,405 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-02 08:24:21,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,406 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-12-02 08:24:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,458 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-12-02 08:24:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 08:24:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,466 INFO L225 Difference]: With dead ends: 5836 [2018-12-02 08:24:21,466 INFO L226 Difference]: Without dead ends: 3338 [2018-12-02 08:24:21,469 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-02 08:24:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-02 08:24:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-12-02 08:24:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-02 08:24:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-12-02 08:24:21,534 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-12-02 08:24:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,534 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-12-02 08:24:21,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-12-02 08:24:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:24:21,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,536 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-02 08:24:21,536 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-12-02 08:24:21,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,550 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-02 08:24:21,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,551 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-12-02 08:24:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,608 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-12-02 08:24:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 08:24:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,617 INFO L225 Difference]: With dead ends: 5004 [2018-12-02 08:24:21,617 INFO L226 Difference]: Without dead ends: 3402 [2018-12-02 08:24:21,619 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-02 08:24:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-12-02 08:24:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-12-02 08:24:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-12-02 08:24:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-12-02 08:24:21,690 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-12-02 08:24:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,691 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-12-02 08:24:21,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-12-02 08:24:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:24:21,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,693 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-02 08:24:21,693 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-12-02 08:24:21,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,703 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-02 08:24:21,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,703 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-12-02 08:24:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:21,820 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-12-02 08:24:21,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:21,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 08:24:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:21,835 INFO L225 Difference]: With dead ends: 9804 [2018-12-02 08:24:21,835 INFO L226 Difference]: Without dead ends: 6538 [2018-12-02 08:24:21,839 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-02 08:24:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-12-02 08:24:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-12-02 08:24:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-12-02 08:24:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-12-02 08:24:21,970 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-12-02 08:24:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:21,971 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-12-02 08:24:21,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-12-02 08:24:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 08:24:21,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:21,975 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-02 08:24:21,975 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:21,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-12-02 08:24:21,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:21,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:21,985 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-02 08:24:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:21,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:21,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:21,986 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-12-02 08:24:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:22,088 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-12-02 08:24:22,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:22,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 08:24:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:22,099 INFO L225 Difference]: With dead ends: 7052 [2018-12-02 08:24:22,099 INFO L226 Difference]: Without dead ends: 7050 [2018-12-02 08:24:22,102 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-02 08:24:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-12-02 08:24:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-12-02 08:24:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-12-02 08:24:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-12-02 08:24:22,210 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-12-02 08:24:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:22,210 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-12-02 08:24:22,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-12-02 08:24:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:24:22,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:22,214 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-02 08:24:22,214 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:22,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-12-02 08:24:22,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:22,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:22,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:24:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:22,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:22,225 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-12-02 08:24:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:22,372 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-12-02 08:24:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:22,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 08:24:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:22,385 INFO L225 Difference]: With dead ends: 10634 [2018-12-02 08:24:22,386 INFO L226 Difference]: Without dead ends: 10632 [2018-12-02 08:24:22,389 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-02 08:24:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-12-02 08:24:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-12-02 08:24:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-12-02 08:24:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-12-02 08:24:22,514 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-12-02 08:24:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:22,514 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-12-02 08:24:22,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-12-02 08:24:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 08:24:22,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:24:22,521 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-02 08:24:22,521 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:24:22,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:24:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-12-02 08:24:22,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 08:24:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 08:24:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:22,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:24:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:24:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:24:22,539 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-02 08:24:22,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:24:22,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:24:22,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:24:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:24:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:24:22,539 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-12-02 08:24:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:24:22,677 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-12-02 08:24:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:24:22,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 08:24:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:24:22,677 INFO L225 Difference]: With dead ends: 22664 [2018-12-02 08:24:22,677 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 08:24:22,691 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-02 08:24:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 08:24:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 08:24:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 08:24:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 08:24:22,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-02 08:24:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:24:22,692 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:24:22,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:24:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 08:24:22,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 08:24:22,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 08:24:22,710 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 08:24:22,710 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 08:24:22,711 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,711 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,712 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,713 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-12-02 08:24:22,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:24:22 BoogieIcfgContainer [2018-12-02 08:24:22,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:24:22,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:24:22,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:24:22,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:24:22,720 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:24:20" (3/4) ... [2018-12-02 08:24:22,723 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 08:24:22,728 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 08:24:22,728 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 08:24:22,731 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 08:24:22,731 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 08:24:22,732 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 08:24:22,764 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dc2cbd30-1ed9-4d15-a840-778abb8ebe69/bin-2019/uautomizer/witness.graphml [2018-12-02 08:24:22,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:24:22,764 INFO L168 Benchmark]: Toolchain (without parser) took 3062.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 953.3 MB in the beginning and 936.5 MB in the end (delta: 16.8 MB). Peak memory consumption was 188.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:24:22,765 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:24:22,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.22 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:24:22,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.88 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:24:22,766 INFO L168 Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:24:22,766 INFO L168 Benchmark]: RCFGBuilder took 165.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:24:22,767 INFO L168 Benchmark]: TraceAbstraction took 2650.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 943.0 MB in the end (delta: 143.3 MB). Peak memory consumption was 207.2 MB. Max. memory is 11.5 GB. [2018-12-02 08:24:22,767 INFO L168 Benchmark]: Witness Printer took 44.74 ms. Allocated memory is still 1.2 GB. Free memory was 943.0 MB in the beginning and 936.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:24:22,768 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.22 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.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.88 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 165.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2650.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 943.0 MB in the end (delta: 143.3 MB). Peak memory consumption was 207.2 MB. Max. memory is 11.5 GB. * Witness Printer took 44.74 ms. Allocated memory is still 1.2 GB. Free memory was 943.0 MB in the beginning and 936.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.1s 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.8s 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...