./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13_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_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 16:48:45,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:48:45,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:48:45,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:48:45,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:48:45,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:48:45,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:48:45,236 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:48:45,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:48:45,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:48:45,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:48:45,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:48:45,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:48:45,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:48:45,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:48:45,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:48:45,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:48:45,241 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:48:45,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:48:45,243 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:48:45,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:48:45,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:48:45,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:48:45,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:48:45,245 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:48:45,246 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:48:45,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:48:45,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:48:45,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:48:45,247 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:48:45,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:48:45,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:48:45,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:48:45,248 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:48:45,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:48:45,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:48:45,249 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 16:48:45,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:48:45,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:48:45,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 16:48:45,257 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 16:48:45,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:48:45,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:48:45,257 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 16:48:45,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:48:45,258 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 16:48:45,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:48:45,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 16:48:45,259 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:48:45,259 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 16:48:45,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:48:45,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 16:48:45,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 16:48:45,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:48:45,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 16:48:45,260 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_dd13dc56-083c-4931-87c5-dd3f529f044c/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-12-01 16:48:45,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:48:45,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:48:45,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:48:45,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:48:45,287 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:48:45,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 16:48:45,324 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/data/412c3c921/eb2c407179e14f6ca07b06c81561f70f/FLAG400df897a [2018-12-01 16:48:45,774 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:48:45,774 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 16:48:45,779 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/data/412c3c921/eb2c407179e14f6ca07b06c81561f70f/FLAG400df897a [2018-12-01 16:48:45,789 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/data/412c3c921/eb2c407179e14f6ca07b06c81561f70f [2018-12-01 16:48:45,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:48:45,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:48:45,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:48:45,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:48:45,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:48:45,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45, skipping insertion in model container [2018-12-01 16:48:45,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:48:45,819 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:48:45,910 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:48:45,912 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:48:45,928 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:48:45,936 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:48:45,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45 WrapperNode [2018-12-01 16:48:45,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:48:45,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:48:45,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:48:45,937 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:48:45,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:48:45,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:48:45,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:48:45,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:48:45,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... [2018-12-01 16:48:45,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:48:45,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:48:45,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:48:45,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:48:45,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/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-01 16:48:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 16:48:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 16:48:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:48:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:48:46,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 16:48:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 16:48:46,177 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:48:46,178 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 16:48:46,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:48:46 BoogieIcfgContainer [2018-12-01 16:48:46,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:48:46,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 16:48:46,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 16:48:46,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 16:48:46,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 04:48:45" (1/3) ... [2018-12-01 16:48:46,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af48ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:48:46, skipping insertion in model container [2018-12-01 16:48:46,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:48:45" (2/3) ... [2018-12-01 16:48:46,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af48ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:48:46, skipping insertion in model container [2018-12-01 16:48:46,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:48:46" (3/3) ... [2018-12-01 16:48:46,182 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 16:48:46,188 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 16:48:46,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 16:48:46,203 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 16:48:46,229 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 16:48:46,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 16:48:46,230 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 16:48:46,230 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 16:48:46,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 16:48:46,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 16:48:46,230 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 16:48:46,230 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 16:48:46,230 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 16:48:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-01 16:48:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 16:48:46,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:46,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-12-01 16:48:46,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,368 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-01 16:48:46,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,382 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-01 16:48:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,412 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-12-01 16:48:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 16:48:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,419 INFO L225 Difference]: With dead ends: 105 [2018-12-01 16:48:46,419 INFO L226 Difference]: Without dead ends: 90 [2018-12-01 16:48:46,421 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-01 16:48:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-01 16:48:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-12-01 16:48:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-01 16:48:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-12-01 16:48:46,445 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-12-01 16:48:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,445 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-12-01 16:48:46,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-12-01 16:48:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 16:48:46,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,446 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-01 16:48:46,446 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-12-01 16:48:46,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:48:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,491 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-12-01 16:48:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,508 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-12-01 16:48:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-01 16:48:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,509 INFO L225 Difference]: With dead ends: 147 [2018-12-01 16:48:46,509 INFO L226 Difference]: Without dead ends: 90 [2018-12-01 16:48:46,510 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-01 16:48:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-01 16:48:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-01 16:48:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-01 16:48:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-12-01 16:48:46,515 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-12-01 16:48:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,515 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-12-01 16:48:46,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-12-01 16:48:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 16:48:46,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,516 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-01 16:48:46,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,516 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-12-01 16:48:46,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,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-01 16:48:46,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,542 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-12-01 16:48:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,552 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-12-01 16:48:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 16:48:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,553 INFO L225 Difference]: With dead ends: 135 [2018-12-01 16:48:46,553 INFO L226 Difference]: Without dead ends: 93 [2018-12-01 16:48:46,554 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-01 16:48:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-01 16:48:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-12-01 16:48:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-01 16:48:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-12-01 16:48:46,558 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-12-01 16:48:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,558 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-12-01 16:48:46,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-12-01 16:48:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 16:48:46,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,559 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-01 16:48:46,559 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-12-01 16:48:46,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,578 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-01 16:48:46,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,578 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-12-01 16:48:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,593 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-12-01 16:48:46,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 16:48:46,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,594 INFO L225 Difference]: With dead ends: 172 [2018-12-01 16:48:46,594 INFO L226 Difference]: Without dead ends: 170 [2018-12-01 16:48:46,594 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-01 16:48:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-01 16:48:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-12-01 16:48:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-01 16:48:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-12-01 16:48:46,600 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-12-01 16:48:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-12-01 16:48:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-12-01 16:48:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 16:48:46,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,601 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-01 16:48:46,601 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-12-01 16:48:46,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,619 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-01 16:48:46,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,619 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-12-01 16:48:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,634 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-12-01 16:48:46,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 16:48:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,635 INFO L225 Difference]: With dead ends: 284 [2018-12-01 16:48:46,635 INFO L226 Difference]: Without dead ends: 172 [2018-12-01 16:48:46,636 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-01 16:48:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-01 16:48:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-12-01 16:48:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-01 16:48:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-12-01 16:48:46,641 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-12-01 16:48:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,642 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-12-01 16:48:46,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-12-01 16:48:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 16:48:46,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,642 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-01 16:48:46,642 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,643 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-12-01 16:48:46,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,659 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-01 16:48:46,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,660 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-12-01 16:48:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,670 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-12-01 16:48:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 16:48:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,671 INFO L225 Difference]: With dead ends: 255 [2018-12-01 16:48:46,671 INFO L226 Difference]: Without dead ends: 174 [2018-12-01 16:48:46,671 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-01 16:48:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-01 16:48:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-12-01 16:48:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-01 16:48:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-12-01 16:48:46,676 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-12-01 16:48:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,676 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-12-01 16:48:46,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-12-01 16:48:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 16:48:46,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,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, 1, 1, 1] [2018-12-01 16:48:46,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-12-01 16:48:46,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,695 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-01 16:48:46,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,695 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-12-01 16:48:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,705 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-12-01 16:48:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 16:48:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,707 INFO L225 Difference]: With dead ends: 324 [2018-12-01 16:48:46,707 INFO L226 Difference]: Without dead ends: 322 [2018-12-01 16:48:46,707 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-01 16:48:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-01 16:48:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-12-01 16:48:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-01 16:48:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-12-01 16:48:46,713 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-12-01 16:48:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,713 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-12-01 16:48:46,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-12-01 16:48:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 16:48:46,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,714 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-01 16:48:46,714 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-12-01 16:48:46,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,729 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-01 16:48:46,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,730 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-12-01 16:48:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,743 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-12-01 16:48:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 16:48:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,745 INFO L225 Difference]: With dead ends: 552 [2018-12-01 16:48:46,745 INFO L226 Difference]: Without dead ends: 330 [2018-12-01 16:48:46,746 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-01 16:48:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-01 16:48:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-12-01 16:48:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-01 16:48:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-12-01 16:48:46,756 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-12-01 16:48:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,757 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-12-01 16:48:46,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-12-01 16:48:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 16:48:46,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,758 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-01 16:48:46,758 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-12-01 16:48:46,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,781 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-01 16:48:46,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,782 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-12-01 16:48:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,798 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-12-01 16:48:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 16:48:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,799 INFO L225 Difference]: With dead ends: 492 [2018-12-01 16:48:46,799 INFO L226 Difference]: Without dead ends: 334 [2018-12-01 16:48:46,800 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-01 16:48:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-01 16:48:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-12-01 16:48:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-01 16:48:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-12-01 16:48:46,810 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-12-01 16:48:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,811 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-12-01 16:48:46,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-12-01 16:48:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 16:48:46,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,812 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-01 16:48:46,812 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-12-01 16:48:46,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,829 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-01 16:48:46,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,830 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-12-01 16:48:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,842 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-12-01 16:48:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 16:48:46,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,844 INFO L225 Difference]: With dead ends: 620 [2018-12-01 16:48:46,844 INFO L226 Difference]: Without dead ends: 618 [2018-12-01 16:48:46,845 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-01 16:48:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-01 16:48:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-12-01 16:48:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-01 16:48:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-12-01 16:48:46,854 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-12-01 16:48:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,854 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-12-01 16:48:46,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-12-01 16:48:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 16:48:46,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,855 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-01 16:48:46,855 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-12-01 16:48:46,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,874 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-01 16:48:46,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,875 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-12-01 16:48:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,892 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-12-01 16:48:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 16:48:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,894 INFO L225 Difference]: With dead ends: 1084 [2018-12-01 16:48:46,894 INFO L226 Difference]: Without dead ends: 642 [2018-12-01 16:48:46,895 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-01 16:48:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-01 16:48:46,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-12-01 16:48:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-01 16:48:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-12-01 16:48:46,907 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-12-01 16:48:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,907 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-12-01 16:48:46,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-12-01 16:48:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 16:48:46,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,908 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-01 16:48:46,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-12-01 16:48:46,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,920 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-01 16:48:46,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,921 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-12-01 16:48:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,938 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-12-01 16:48:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 16:48:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,940 INFO L225 Difference]: With dead ends: 960 [2018-12-01 16:48:46,940 INFO L226 Difference]: Without dead ends: 650 [2018-12-01 16:48:46,941 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-01 16:48:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-12-01 16:48:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-12-01 16:48:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-01 16:48:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-12-01 16:48:46,952 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-12-01 16:48:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:46,953 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-12-01 16:48:46,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-12-01 16:48:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 16:48:46,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:46,953 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-01 16:48:46,954 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:46,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-12-01 16:48:46,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:46,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:46,970 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-01 16:48:46,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:46,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:46,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:46,971 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-12-01 16:48:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:46,991 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-12-01 16:48:46,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:46,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 16:48:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:46,994 INFO L225 Difference]: With dead ends: 1196 [2018-12-01 16:48:46,994 INFO L226 Difference]: Without dead ends: 1194 [2018-12-01 16:48:46,994 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-01 16:48:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-12-01 16:48:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-12-01 16:48:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-01 16:48:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-12-01 16:48:47,010 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-12-01 16:48:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,010 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-12-01 16:48:47,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-12-01 16:48:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 16:48:47,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,011 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-01 16:48:47,012 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-12-01 16:48:47,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,022 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-01 16:48:47,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,023 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-12-01 16:48:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,052 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-12-01 16:48:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 16:48:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,056 INFO L225 Difference]: With dead ends: 2140 [2018-12-01 16:48:47,056 INFO L226 Difference]: Without dead ends: 1258 [2018-12-01 16:48:47,058 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-01 16:48:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-01 16:48:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-12-01 16:48:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-12-01 16:48:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-12-01 16:48:47,086 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-12-01 16:48:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,086 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-12-01 16:48:47,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-12-01 16:48:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 16:48:47,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,087 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, 1] [2018-12-01 16:48:47,088 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,088 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-12-01 16:48:47,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,102 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-01 16:48:47,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,103 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-12-01 16:48:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,122 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-12-01 16:48:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 16:48:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,124 INFO L225 Difference]: With dead ends: 1884 [2018-12-01 16:48:47,124 INFO L226 Difference]: Without dead ends: 1274 [2018-12-01 16:48:47,125 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-01 16:48:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-12-01 16:48:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-12-01 16:48:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-01 16:48:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-12-01 16:48:47,147 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-12-01 16:48:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,148 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-12-01 16:48:47,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-12-01 16:48:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 16:48:47,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,149 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, 1] [2018-12-01 16:48:47,149 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-12-01 16:48:47,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,159 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-01 16:48:47,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,160 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-12-01 16:48:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,182 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-12-01 16:48:47,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 16:48:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,186 INFO L225 Difference]: With dead ends: 2316 [2018-12-01 16:48:47,186 INFO L226 Difference]: Without dead ends: 2314 [2018-12-01 16:48:47,187 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-01 16:48:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-01 16:48:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-12-01 16:48:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-12-01 16:48:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-12-01 16:48:47,217 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-12-01 16:48:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,217 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-12-01 16:48:47,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-12-01 16:48:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 16:48:47,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,218 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, 1] [2018-12-01 16:48:47,219 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-12-01 16:48:47,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,229 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-01 16:48:47,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,230 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-12-01 16:48:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,267 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-12-01 16:48:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 16:48:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,272 INFO L225 Difference]: With dead ends: 4236 [2018-12-01 16:48:47,272 INFO L226 Difference]: Without dead ends: 2474 [2018-12-01 16:48:47,274 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-01 16:48:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-12-01 16:48:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-12-01 16:48:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-12-01 16:48:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-12-01 16:48:47,332 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-12-01 16:48:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,332 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-12-01 16:48:47,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-12-01 16:48:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 16:48:47,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,334 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, 1, 1] [2018-12-01 16:48:47,334 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-12-01 16:48:47,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,344 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-01 16:48:47,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,345 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-12-01 16:48:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,382 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-12-01 16:48:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 16:48:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,389 INFO L225 Difference]: With dead ends: 3708 [2018-12-01 16:48:47,389 INFO L226 Difference]: Without dead ends: 2506 [2018-12-01 16:48:47,391 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-01 16:48:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-01 16:48:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-12-01 16:48:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-12-01 16:48:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-12-01 16:48:47,451 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-12-01 16:48:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,451 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-12-01 16:48:47,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-12-01 16:48:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 16:48:47,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,453 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, 1, 1] [2018-12-01 16:48:47,453 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-12-01 16:48:47,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,466 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-01 16:48:47,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,466 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-12-01 16:48:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,516 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-12-01 16:48:47,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 16:48:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,524 INFO L225 Difference]: With dead ends: 4492 [2018-12-01 16:48:47,524 INFO L226 Difference]: Without dead ends: 4490 [2018-12-01 16:48:47,526 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-01 16:48:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-01 16:48:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-12-01 16:48:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-12-01 16:48:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-12-01 16:48:47,578 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-12-01 16:48:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,578 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-12-01 16:48:47,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-12-01 16:48:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 16:48:47,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,580 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, 1, 1] [2018-12-01 16:48:47,580 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-12-01 16:48:47,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,594 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-01 16:48:47,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,594 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-12-01 16:48:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,646 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-12-01 16:48:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 16:48:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,654 INFO L225 Difference]: With dead ends: 8396 [2018-12-01 16:48:47,655 INFO L226 Difference]: Without dead ends: 4874 [2018-12-01 16:48:47,658 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-01 16:48:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-01 16:48:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-12-01 16:48:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-12-01 16:48:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-12-01 16:48:47,731 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-12-01 16:48:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,731 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-12-01 16:48:47,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-12-01 16:48:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 16:48:47,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,733 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, 1, 1, 1] [2018-12-01 16:48:47,734 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-12-01 16:48:47,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,747 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-01 16:48:47,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,747 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-12-01 16:48:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:47,813 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-12-01 16:48:47,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:47,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 16:48:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:47,821 INFO L225 Difference]: With dead ends: 7308 [2018-12-01 16:48:47,821 INFO L226 Difference]: Without dead ends: 4938 [2018-12-01 16:48:47,824 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-01 16:48:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-12-01 16:48:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-12-01 16:48:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-12-01 16:48:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-12-01 16:48:47,916 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-12-01 16:48:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:47,917 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-12-01 16:48:47,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-12-01 16:48:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 16:48:47,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:47,920 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, 1, 1, 1] [2018-12-01 16:48:47,921 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:47,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-12-01 16:48:47,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:47,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:47,933 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-01 16:48:47,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:47,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:47,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:47,934 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-12-01 16:48:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:48,069 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-12-01 16:48:48,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:48,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 16:48:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:48,088 INFO L225 Difference]: With dead ends: 14412 [2018-12-01 16:48:48,088 INFO L226 Difference]: Without dead ends: 9610 [2018-12-01 16:48:48,097 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-01 16:48:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-01 16:48:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-12-01 16:48:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-01 16:48:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-12-01 16:48:48,298 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-12-01 16:48:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:48,299 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-12-01 16:48:48,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-12-01 16:48:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 16:48:48,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:48,303 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, 1, 1, 1] [2018-12-01 16:48:48,303 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:48,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:48,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-12-01 16:48:48,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:48,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:48,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:48,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:48,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:48,312 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-01 16:48:48,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:48,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:48,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:48,313 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-12-01 16:48:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:48,396 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-12-01 16:48:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:48,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 16:48:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:48,415 INFO L225 Difference]: With dead ends: 11148 [2018-12-01 16:48:48,416 INFO L226 Difference]: Without dead ends: 11146 [2018-12-01 16:48:48,419 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-01 16:48:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-01 16:48:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-12-01 16:48:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-01 16:48:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-12-01 16:48:48,537 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-12-01 16:48:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:48,537 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-12-01 16:48:48,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-12-01 16:48:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 16:48:48,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:48,542 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, 1, 1, 1, 1] [2018-12-01 16:48:48,542 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:48,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-12-01 16:48:48,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:48,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:48,551 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-01 16:48:48,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:48,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:48,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:48,552 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-12-01 16:48:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:48,669 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-12-01 16:48:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:48,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 16:48:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:48,686 INFO L225 Difference]: With dead ends: 16780 [2018-12-01 16:48:48,686 INFO L226 Difference]: Without dead ends: 16778 [2018-12-01 16:48:48,689 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-01 16:48:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-12-01 16:48:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-12-01 16:48:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-01 16:48:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-12-01 16:48:48,854 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-12-01 16:48:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:48,855 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-12-01 16:48:48,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-12-01 16:48:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 16:48:48,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:48,863 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, 1, 1, 1, 1] [2018-12-01 16:48:48,863 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:48,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:48,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-12-01 16:48:48,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:48,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:48,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:48,874 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-01 16:48:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:48,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:48,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:48,875 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-12-01 16:48:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:49,036 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-12-01 16:48:49,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:49,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 16:48:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:49,053 INFO L225 Difference]: With dead ends: 32908 [2018-12-01 16:48:49,053 INFO L226 Difference]: Without dead ends: 18826 [2018-12-01 16:48:49,063 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-01 16:48:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-12-01 16:48:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-12-01 16:48:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-12-01 16:48:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-12-01 16:48:49,272 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-12-01 16:48:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:49,272 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-12-01 16:48:49,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-12-01 16:48:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 16:48:49,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:49,279 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, 1, 1, 1, 1, 1] [2018-12-01 16:48:49,279 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:49,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-12-01 16:48:49,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:49,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:49,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:49,294 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-01 16:48:49,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:49,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:49,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:49,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:49,295 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-12-01 16:48:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:49,438 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-12-01 16:48:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:49,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 16:48:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:49,457 INFO L225 Difference]: With dead ends: 28428 [2018-12-01 16:48:49,457 INFO L226 Difference]: Without dead ends: 19210 [2018-12-01 16:48:49,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-01 16:48:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-12-01 16:48:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-12-01 16:48:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-12-01 16:48:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-12-01 16:48:49,704 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-12-01 16:48:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:49,704 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-12-01 16:48:49,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-12-01 16:48:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 16:48:49,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:49,711 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, 1, 1, 1, 1, 1] [2018-12-01 16:48:49,711 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:49,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-12-01 16:48:49,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:49,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:49,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:49,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:49,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:49,721 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-01 16:48:49,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:49,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:49,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:49,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:49,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:49,721 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-12-01 16:48:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:49,933 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-12-01 16:48:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:49,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 16:48:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:49,954 INFO L225 Difference]: With dead ends: 32780 [2018-12-01 16:48:49,955 INFO L226 Difference]: Without dead ends: 32778 [2018-12-01 16:48:49,960 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-01 16:48:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-12-01 16:48:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-12-01 16:48:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-12-01 16:48:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-12-01 16:48:50,262 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-12-01 16:48:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:50,262 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-12-01 16:48:50,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-12-01 16:48:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 16:48:50,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:50,278 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, 1, 1, 1, 1, 1] [2018-12-01 16:48:50,278 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:50,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-12-01 16:48:50,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:50,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:50,297 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-01 16:48:50,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:50,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:50,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:50,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:50,298 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-12-01 16:48:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:50,601 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-12-01 16:48:50,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:50,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 16:48:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:50,624 INFO L225 Difference]: With dead ends: 65548 [2018-12-01 16:48:50,625 INFO L226 Difference]: Without dead ends: 37386 [2018-12-01 16:48:50,643 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-01 16:48:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-12-01 16:48:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-12-01 16:48:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-12-01 16:48:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-12-01 16:48:51,052 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-12-01 16:48:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:51,053 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-12-01 16:48:51,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-12-01 16:48:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:48:51,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:51,063 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, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:51,063 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:51,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-12-01 16:48:51,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:51,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:51,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:51,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:51,083 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-01 16:48:51,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:51,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:51,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:51,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:51,083 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-12-01 16:48:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:51,366 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-12-01 16:48:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 16:48:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:51,392 INFO L225 Difference]: With dead ends: 56076 [2018-12-01 16:48:51,392 INFO L226 Difference]: Without dead ends: 37898 [2018-12-01 16:48:51,405 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-01 16:48:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-12-01 16:48:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-12-01 16:48:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-12-01 16:48:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-12-01 16:48:51,847 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-12-01 16:48:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:51,847 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-12-01 16:48:51,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-12-01 16:48:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:48:51,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:51,858 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, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:51,858 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:51,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-12-01 16:48:51,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:51,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:51,882 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-01 16:48:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:51,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:51,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:51,883 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-12-01 16:48:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:52,437 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-12-01 16:48:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:52,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 16:48:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:52,478 INFO L225 Difference]: With dead ends: 63500 [2018-12-01 16:48:52,479 INFO L226 Difference]: Without dead ends: 63498 [2018-12-01 16:48:52,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-12-01 16:48:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-12-01 16:48:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-12-01 16:48:53,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-12-01 16:48:53,063 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-12-01 16:48:53,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:53,064 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-12-01 16:48:53,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-12-01 16:48:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:48:53,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:53,086 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, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:53,086 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:53,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:53,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-12-01 16:48:53,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:53,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:53,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:53,097 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-01 16:48:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:53,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:53,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:53,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:53,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:53,098 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-12-01 16:48:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:53,741 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-12-01 16:48:53,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:53,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 16:48:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:53,786 INFO L225 Difference]: With dead ends: 130060 [2018-12-01 16:48:53,786 INFO L226 Difference]: Without dead ends: 73738 [2018-12-01 16:48:53,817 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-01 16:48:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-12-01 16:48:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-12-01 16:48:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-12-01 16:48:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-12-01 16:48:54,686 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-12-01 16:48:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:54,686 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-12-01 16:48:54,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-12-01 16:48:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:48:54,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:54,710 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:54,710 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:54,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-12-01 16:48:54,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:54,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:54,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:54,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:54,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:48:54,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:54,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:54,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:54,736 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-12-01 16:48:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:55,428 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-12-01 16:48:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:55,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 16:48:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:55,475 INFO L225 Difference]: With dead ends: 110604 [2018-12-01 16:48:55,475 INFO L226 Difference]: Without dead ends: 74762 [2018-12-01 16:48:55,498 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-01 16:48:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-12-01 16:48:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-12-01 16:48:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-12-01 16:48:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-12-01 16:48:56,398 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-12-01 16:48:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:56,398 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-12-01 16:48:56,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-12-01 16:48:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:48:56,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:56,423 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:56,423 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:56,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-12-01 16:48:56,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:56,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:56,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:56,529 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-01 16:48:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:56,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:56,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:56,529 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-12-01 16:48:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:48:57,487 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-12-01 16:48:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:48:57,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 16:48:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:48:57,577 INFO L225 Difference]: With dead ends: 122892 [2018-12-01 16:48:57,577 INFO L226 Difference]: Without dead ends: 122890 [2018-12-01 16:48:57,600 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-01 16:48:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-12-01 16:48:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-12-01 16:48:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-12-01 16:48:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-12-01 16:48:59,013 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-12-01 16:48:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:48:59,013 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-12-01 16:48:59,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:48:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-12-01 16:48:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:48:59,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:48:59,062 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:48:59,062 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:48:59,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:48:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-12-01 16:48:59,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:48:59,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:48:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:59,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:48:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:48:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:48:59,075 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-01 16:48:59,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:48:59,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:48:59,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:48:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:48:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:48:59,076 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-12-01 16:49:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:49:00,385 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-12-01 16:49:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:49:00,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 16:49:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:49:00,496 INFO L225 Difference]: With dead ends: 258060 [2018-12-01 16:49:00,496 INFO L226 Difference]: Without dead ends: 145418 [2018-12-01 16:49:00,570 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-01 16:49:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-12-01 16:49:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-12-01 16:49:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-12-01 16:49:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-12-01 16:49:02,512 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-12-01 16:49:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:49:02,512 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-12-01 16:49:02,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:49:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-12-01 16:49:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:49:02,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:49:02,565 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:49:02,565 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:49:02,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:49:02,565 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-12-01 16:49:02,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:49:02,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:49:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:49:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:49:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:49:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:49:02,577 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-01 16:49:02,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:49:02,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:49:02,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:49:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:49:02,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:49:02,578 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-12-01 16:49:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:49:04,007 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-12-01 16:49:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:49:04,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 16:49:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:49:04,112 INFO L225 Difference]: With dead ends: 218124 [2018-12-01 16:49:04,112 INFO L226 Difference]: Without dead ends: 147466 [2018-12-01 16:49:04,159 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-01 16:49:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-01 16:49:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-12-01 16:49:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-12-01 16:49:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-12-01 16:49:06,043 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-12-01 16:49:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:49:06,043 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-12-01 16:49:06,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:49:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-12-01 16:49:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:49:06,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:49:06,096 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:49:06,096 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:49:06,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:49:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-12-01 16:49:06,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:49:06,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:49:06,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:49:06,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:49:06,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:49:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:49:06,109 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-01 16:49:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:49:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:49:06,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:49:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:49:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:49:06,110 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-12-01 16:49:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:49:08,266 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-12-01 16:49:08,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:49:08,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 16:49:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:49:08,460 INFO L225 Difference]: With dead ends: 237578 [2018-12-01 16:49:08,460 INFO L226 Difference]: Without dead ends: 237576 [2018-12-01 16:49:08,498 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-01 16:49:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-12-01 16:49:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-12-01 16:49:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-12-01 16:49:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-12-01 16:49:12,234 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-12-01 16:49:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:49:12,234 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-12-01 16:49:12,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:49:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-12-01 16:49:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:49:12,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 16:49:12,344 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 16:49:12,344 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 16:49:12,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:49:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-12-01 16:49:12,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 16:49:12,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 16:49:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:49:12,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 16:49:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 16:49:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:49:12,354 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-01 16:49:12,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 16:49:12,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 16:49:12,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 16:49:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 16:49:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 16:49:12,354 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-12-01 16:49:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 16:49:15,191 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-12-01 16:49:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 16:49:15,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 16:49:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 16:49:15,192 INFO L225 Difference]: With dead ends: 512008 [2018-12-01 16:49:15,192 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 16:49:15,352 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-01 16:49:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 16:49:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 16:49:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 16:49:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 16:49:15,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-01 16:49:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 16:49:15,353 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 16:49:15,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 16:49:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 16:49:15,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 16:49:15,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 16:49:15,396 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 16:49:15,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 16:49:15,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 16:49:15,396 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 16:49:15,396 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 16:49:15,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 16:49:15,396 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-12-01 16:49:15,396 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-01 16:49:15,396 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,396 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,397 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-12-01 16:49:15,398 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-12-01 16:49:15,399 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-01 16:49:15,400 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,400 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,400 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-12-01 16:49:15,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 04:49:15 BoogieIcfgContainer [2018-12-01 16:49:15,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 16:49:15,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:49:15,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:49:15,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:49:15,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:48:46" (3/4) ... [2018-12-01 16:49:15,410 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 16:49:15,415 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 16:49:15,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 16:49:15,420 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 16:49:15,420 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 16:49:15,420 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 16:49:15,454 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dd13dc56-083c-4931-87c5-dd3f529f044c/bin-2019/uautomizer/witness.graphml [2018-12-01 16:49:15,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:49:15,455 INFO L168 Benchmark]: Toolchain (without parser) took 29663.25 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 957.1 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,456 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:49:15,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.07 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,456 INFO L168 Benchmark]: Boogie Preprocessor took 45.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,457 INFO L168 Benchmark]: RCFGBuilder took 183.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,457 INFO L168 Benchmark]: TraceAbstraction took 29226.97 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,457 INFO L168 Benchmark]: Witness Printer took 48.55 ms. Allocated memory is still 5.4 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. [2018-12-01 16:49:15,459 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 12.07 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29226.97 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 48.55 ms. Allocated memory is still 5.4 GB. Free memory was 4.1 GB in the beginning and 4.0 GB in the end (delta: 68.0 MB). Peak memory consumption was 68.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 29.1s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, 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: 13.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...