./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:32:46,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:32:46,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:32:46,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:32:46,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:32:46,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:32:46,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:32:46,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:32:46,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:32:46,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:32:46,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:32:46,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:32:46,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:32:46,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:32:46,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:32:46,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:32:46,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:32:46,218 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:32:46,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:32:46,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:32:46,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:32:46,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:32:46,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:32:46,223 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:32:46,223 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:32:46,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:32:46,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:32:46,225 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:32:46,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:32:46,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:32:46,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:32:46,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:32:46,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:32:46,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:32:46,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:32:46,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:32:46,229 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:32:46,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:32:46,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:32:46,239 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:32:46,239 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:32:46,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:32:46,239 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:32:46,239 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:32:46,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:32:46,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:32:46,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:32:46,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:32:46,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:32:46,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:32:46,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:32:46,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:32:46,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:32:46,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:32:46,242 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_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-23 08:32:46,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:32:46,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:32:46,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:32:46,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:32:46,278 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:32:46,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 08:32:46,314 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/data/2a777b210/508637731ac341e5a0aab418b4bc8fcb/FLAG16c1a9f3a [2018-11-23 08:32:46,639 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:32:46,639 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 08:32:46,645 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/data/2a777b210/508637731ac341e5a0aab418b4bc8fcb/FLAG16c1a9f3a [2018-11-23 08:32:46,657 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/data/2a777b210/508637731ac341e5a0aab418b4bc8fcb [2018-11-23 08:32:46,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:32:46,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:32:46,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:32:46,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:32:46,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:32:46,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46, skipping insertion in model container [2018-11-23 08:32:46,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:32:46,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:32:46,832 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:32:46,834 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:32:46,852 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:32:46,861 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:32:46,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46 WrapperNode [2018-11-23 08:32:46,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:32:46,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:32:46,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:32:46,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:32:46,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:32:46,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:32:46,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:32:46,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:32:46,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... [2018-11-23 08:32:46,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:32:46,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:32:46,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:32:46,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:32:46,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:32:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:32:46,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:32:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:32:46,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:32:46,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:32:46,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:32:47,145 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:32:47,145 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 08:32:47,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:47 BoogieIcfgContainer [2018-11-23 08:32:47,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:32:47,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:32:47,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:32:47,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:32:47,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:32:46" (1/3) ... [2018-11-23 08:32:47,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bb27dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:32:47, skipping insertion in model container [2018-11-23 08:32:47,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:46" (2/3) ... [2018-11-23 08:32:47,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bb27dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:32:47, skipping insertion in model container [2018-11-23 08:32:47,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:47" (3/3) ... [2018-11-23 08:32:47,152 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 08:32:47,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:32:47,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:32:47,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:32:47,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:32:47,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:32:47,199 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:32:47,199 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:32:47,199 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:32:47,199 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:32:47,199 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:32:47,199 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:32:47,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:32:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 08:32:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:32:47,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:47,215 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,218 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-11-23 08:32:47,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,346 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-23 08:32:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,376 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-11-23 08:32:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:32:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,383 INFO L225 Difference]: With dead ends: 93 [2018-11-23 08:32:47,383 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 08:32:47,385 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-11-23 08:32:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 08:32:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-11-23 08:32:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 08:32:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-11-23 08:32:47,410 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-11-23 08:32:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,410 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-11-23 08:32:47,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-11-23 08:32:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:32:47,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:47,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-11-23 08:32:47,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,467 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-11-23 08:32:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,498 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-11-23 08:32:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:32:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,500 INFO L225 Difference]: With dead ends: 127 [2018-11-23 08:32:47,500 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 08:32:47,501 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-11-23 08:32:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 08:32:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 08:32:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 08:32:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-11-23 08:32:47,506 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-11-23 08:32:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,506 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-11-23 08:32:47,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-11-23 08:32:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 08:32:47,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:47,507 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-11-23 08:32:47,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,550 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-11-23 08:32:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,564 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-11-23 08:32:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 08:32:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,566 INFO L225 Difference]: With dead ends: 117 [2018-11-23 08:32:47,566 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 08:32:47,566 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-11-23 08:32:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 08:32:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-23 08:32:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 08:32:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-23 08:32:47,574 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-11-23 08:32:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,575 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-23 08:32:47,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-23 08:32:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 08:32:47,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:47,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-11-23 08:32:47,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,603 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-11-23 08:32:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,615 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-11-23 08:32:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 08:32:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,617 INFO L225 Difference]: With dead ends: 148 [2018-11-23 08:32:47,617 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 08:32:47,617 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-11-23 08:32:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 08:32:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-11-23 08:32:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 08:32:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-11-23 08:32:47,625 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-11-23 08:32:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,625 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-11-23 08:32:47,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,625 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-11-23 08:32:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 08:32:47,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:47,626 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-11-23 08:32:47,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,663 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-11-23 08:32:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,677 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-11-23 08:32:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 08:32:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,679 INFO L225 Difference]: With dead ends: 244 [2018-11-23 08:32:47,679 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 08:32:47,679 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-11-23 08:32:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 08:32:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-23 08:32:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 08:32:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-11-23 08:32:47,687 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-11-23 08:32:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,687 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-11-23 08:32:47,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-11-23 08:32:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 08:32:47,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,688 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-11-23 08:32:47,689 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-11-23 08:32:47,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,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-11-23 08:32:47,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,730 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-11-23 08:32:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,743 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-11-23 08:32:47,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 08:32:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,744 INFO L225 Difference]: With dead ends: 219 [2018-11-23 08:32:47,744 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 08:32:47,745 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-11-23 08:32:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 08:32:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-23 08:32:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 08:32:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-11-23 08:32:47,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-11-23 08:32:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,752 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-11-23 08:32:47,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-11-23 08:32:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 08:32:47,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,753 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-11-23 08:32:47,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-11-23 08:32:47,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,789 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-11-23 08:32:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,805 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-11-23 08:32:47,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 08:32:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,807 INFO L225 Difference]: With dead ends: 276 [2018-11-23 08:32:47,807 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 08:32:47,807 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-11-23 08:32:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 08:32:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-11-23 08:32:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-23 08:32:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-11-23 08:32:47,815 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-11-23 08:32:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,816 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-11-23 08:32:47,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-11-23 08:32:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 08:32:47,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,816 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-11-23 08:32:47,817 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-11-23 08:32:47,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,833 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-11-23 08:32:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,857 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-11-23 08:32:47,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 08:32:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,858 INFO L225 Difference]: With dead ends: 472 [2018-11-23 08:32:47,858 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 08:32:47,859 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-11-23 08:32:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 08:32:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-11-23 08:32:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-23 08:32:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-11-23 08:32:47,868 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-11-23 08:32:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,868 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-11-23 08:32:47,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-11-23 08:32:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 08:32:47,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,869 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-11-23 08:32:47,870 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-11-23 08:32:47,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,901 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-11-23 08:32:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,925 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-11-23 08:32:47,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 08:32:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,927 INFO L225 Difference]: With dead ends: 420 [2018-11-23 08:32:47,927 INFO L226 Difference]: Without dead ends: 286 [2018-11-23 08:32:47,928 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-11-23 08:32:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-23 08:32:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-23 08:32:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 08:32:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-11-23 08:32:47,936 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-11-23 08:32:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:47,936 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-11-23 08:32:47,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:47,936 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-11-23 08:32:47,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 08:32:47,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:47,937 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-11-23 08:32:47,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:47,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:47,938 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-11-23 08:32:47,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:47,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:47,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:47,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:47,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:47,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:47,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:47,959 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-11-23 08:32:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:47,987 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-11-23 08:32:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:47,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 08:32:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:47,989 INFO L225 Difference]: With dead ends: 524 [2018-11-23 08:32:47,989 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 08:32:47,989 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-11-23 08:32:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 08:32:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-11-23 08:32:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-23 08:32:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-11-23 08:32:48,002 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-11-23 08:32:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,003 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-11-23 08:32:48,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-11-23 08:32:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 08:32:48,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,004 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-11-23 08:32:48,004 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-11-23 08:32:48,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,034 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-11-23 08:32:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,058 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-11-23 08:32:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 08:32:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,061 INFO L225 Difference]: With dead ends: 924 [2018-11-23 08:32:48,061 INFO L226 Difference]: Without dead ends: 546 [2018-11-23 08:32:48,062 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-11-23 08:32:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-23 08:32:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-11-23 08:32:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-23 08:32:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-11-23 08:32:48,078 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-11-23 08:32:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,078 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-11-23 08:32:48,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-11-23 08:32:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:32:48,079 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,080 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-11-23 08:32:48,080 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-11-23 08:32:48,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,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-11-23 08:32:48,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,110 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-11-23 08:32:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,148 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-11-23 08:32:48,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 08:32:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,151 INFO L225 Difference]: With dead ends: 816 [2018-11-23 08:32:48,151 INFO L226 Difference]: Without dead ends: 554 [2018-11-23 08:32:48,151 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-11-23 08:32:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-23 08:32:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-11-23 08:32:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-23 08:32:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-11-23 08:32:48,167 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-11-23 08:32:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,168 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-11-23 08:32:48,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-11-23 08:32:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:32:48,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,169 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-11-23 08:32:48,169 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-11-23 08:32:48,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,186 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-11-23 08:32:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,209 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-11-23 08:32:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 08:32:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,213 INFO L225 Difference]: With dead ends: 1004 [2018-11-23 08:32:48,213 INFO L226 Difference]: Without dead ends: 1002 [2018-11-23 08:32:48,213 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-11-23 08:32:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-23 08:32:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-11-23 08:32:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 08:32:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-11-23 08:32:48,235 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-11-23 08:32:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,236 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-11-23 08:32:48,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-11-23 08:32:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:32:48,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,237 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-11-23 08:32:48,237 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-11-23 08:32:48,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,254 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-11-23 08:32:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,305 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-11-23 08:32:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 08:32:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,308 INFO L225 Difference]: With dead ends: 1820 [2018-11-23 08:32:48,308 INFO L226 Difference]: Without dead ends: 1066 [2018-11-23 08:32:48,310 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-11-23 08:32:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-23 08:32:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-11-23 08:32:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-23 08:32:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-11-23 08:32:48,343 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-11-23 08:32:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,343 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-11-23 08:32:48,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-11-23 08:32:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:32:48,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,345 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-11-23 08:32:48,345 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,345 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-11-23 08:32:48,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,362 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-11-23 08:32:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,389 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-11-23 08:32:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 08:32:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,393 INFO L225 Difference]: With dead ends: 1596 [2018-11-23 08:32:48,393 INFO L226 Difference]: Without dead ends: 1082 [2018-11-23 08:32:48,394 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-11-23 08:32:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-11-23 08:32:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-11-23 08:32:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-11-23 08:32:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-11-23 08:32:48,428 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-11-23 08:32:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,428 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-11-23 08:32:48,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-11-23 08:32:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:32:48,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,430 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-11-23 08:32:48,430 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-11-23 08:32:48,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,450 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-11-23 08:32:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,498 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-11-23 08:32:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 08:32:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,504 INFO L225 Difference]: With dead ends: 1932 [2018-11-23 08:32:48,504 INFO L226 Difference]: Without dead ends: 1930 [2018-11-23 08:32:48,505 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-11-23 08:32:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-23 08:32:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-11-23 08:32:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 08:32:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-11-23 08:32:48,550 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-11-23 08:32:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,550 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-11-23 08:32:48,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-11-23 08:32:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 08:32:48,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:48,553 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-11-23 08:32:48,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,585 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-11-23 08:32:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,643 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-11-23 08:32:48,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 08:32:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,649 INFO L225 Difference]: With dead ends: 3596 [2018-11-23 08:32:48,649 INFO L226 Difference]: Without dead ends: 2090 [2018-11-23 08:32:48,651 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-11-23 08:32:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-11-23 08:32:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-11-23 08:32:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-23 08:32:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-11-23 08:32:48,707 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-11-23 08:32:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,707 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-11-23 08:32:48,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-11-23 08:32:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 08:32:48,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,709 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-11-23 08:32:48,709 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-11-23 08:32:48,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,735 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-11-23 08:32:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,786 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-11-23 08:32:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 08:32:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,792 INFO L225 Difference]: With dead ends: 3132 [2018-11-23 08:32:48,792 INFO L226 Difference]: Without dead ends: 2122 [2018-11-23 08:32:48,793 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-11-23 08:32:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-23 08:32:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-11-23 08:32:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-23 08:32:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-11-23 08:32:48,849 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-11-23 08:32:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:48,849 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-11-23 08:32:48,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-11-23 08:32:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 08:32:48,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:48,851 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-11-23 08:32:48,851 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:48,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-11-23 08:32:48,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:48,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:48,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:48,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:48,899 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-11-23 08:32:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:48,961 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-11-23 08:32:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:48,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 08:32:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:48,972 INFO L225 Difference]: With dead ends: 3724 [2018-11-23 08:32:48,972 INFO L226 Difference]: Without dead ends: 3722 [2018-11-23 08:32:48,974 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-11-23 08:32:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-23 08:32:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-11-23 08:32:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-11-23 08:32:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-11-23 08:32:49,049 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-11-23 08:32:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:49,050 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-11-23 08:32:49,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-11-23 08:32:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 08:32:49,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:49,054 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-11-23 08:32:49,054 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:49,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-11-23 08:32:49,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:49,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:49,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:49,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:49,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:49,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:49,079 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-11-23 08:32:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:49,172 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-11-23 08:32:49,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:49,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 08:32:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:49,183 INFO L225 Difference]: With dead ends: 7116 [2018-11-23 08:32:49,183 INFO L226 Difference]: Without dead ends: 4106 [2018-11-23 08:32:49,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-11-23 08:32:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-23 08:32:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-11-23 08:32:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-23 08:32:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-11-23 08:32:49,291 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-11-23 08:32:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:49,291 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-11-23 08:32:49,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-11-23 08:32:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 08:32:49,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:49,295 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-11-23 08:32:49,295 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-11-23 08:32:49,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:49,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:49,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:49,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:49,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:49,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:49,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:49,310 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-11-23 08:32:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:49,387 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-11-23 08:32:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:49,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 08:32:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:49,397 INFO L225 Difference]: With dead ends: 6156 [2018-11-23 08:32:49,397 INFO L226 Difference]: Without dead ends: 4170 [2018-11-23 08:32:49,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-23 08:32:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-11-23 08:32:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-11-23 08:32:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-11-23 08:32:49,519 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-11-23 08:32:49,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:49,520 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-11-23 08:32:49,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-11-23 08:32:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 08:32:49,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:49,523 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-11-23 08:32:49,524 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:49,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-11-23 08:32:49,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:49,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:49,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:49,562 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-11-23 08:32:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:49,678 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-11-23 08:32:49,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:49,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 08:32:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:49,690 INFO L225 Difference]: With dead ends: 12108 [2018-11-23 08:32:49,691 INFO L226 Difference]: Without dead ends: 8074 [2018-11-23 08:32:49,697 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-11-23 08:32:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-23 08:32:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-11-23 08:32:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 08:32:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-11-23 08:32:49,880 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-11-23 08:32:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:49,880 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-11-23 08:32:49,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-11-23 08:32:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 08:32:49,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:49,886 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-11-23 08:32:49,887 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:49,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-11-23 08:32:49,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:49,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:49,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:49,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:49,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:49,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:49,906 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-11-23 08:32:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:50,036 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-11-23 08:32:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:50,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 08:32:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:50,049 INFO L225 Difference]: With dead ends: 9100 [2018-11-23 08:32:50,049 INFO L226 Difference]: Without dead ends: 9098 [2018-11-23 08:32:50,052 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-11-23 08:32:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-11-23 08:32:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-11-23 08:32:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-23 08:32:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-11-23 08:32:50,231 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-11-23 08:32:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:50,232 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-11-23 08:32:50,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-11-23 08:32:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 08:32:50,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:50,240 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-11-23 08:32:50,240 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:50,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:50,240 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-11-23 08:32:50,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:50,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:50,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:50,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:50,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:50,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:50,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:50,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:50,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:50,283 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-11-23 08:32:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:50,463 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-11-23 08:32:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:50,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 08:32:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:50,482 INFO L225 Difference]: With dead ends: 13708 [2018-11-23 08:32:50,482 INFO L226 Difference]: Without dead ends: 13706 [2018-11-23 08:32:50,486 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-11-23 08:32:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-11-23 08:32:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-11-23 08:32:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-23 08:32:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-11-23 08:32:50,686 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-11-23 08:32:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:50,687 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-11-23 08:32:50,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-11-23 08:32:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 08:32:50,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:50,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:50,696 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:50,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-11-23 08:32:50,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:50,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:50,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:50,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:50,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:50,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:50,714 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-11-23 08:32:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:50,922 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-11-23 08:32:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:50,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 08:32:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:50,937 INFO L225 Difference]: With dead ends: 27788 [2018-11-23 08:32:50,937 INFO L226 Difference]: Without dead ends: 15754 [2018-11-23 08:32:50,976 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-11-23 08:32:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-11-23 08:32:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-11-23 08:32:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-11-23 08:32:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-11-23 08:32:51,163 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-11-23 08:32:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:51,163 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-11-23 08:32:51,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-11-23 08:32:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:32:51,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:51,169 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-11-23 08:32:51,170 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:51,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:51,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-11-23 08:32:51,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:51,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:51,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:51,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:51,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:51,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:51,189 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-11-23 08:32:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:51,310 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-11-23 08:32:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:51,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 08:32:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:51,323 INFO L225 Difference]: With dead ends: 23820 [2018-11-23 08:32:51,323 INFO L226 Difference]: Without dead ends: 16138 [2018-11-23 08:32:51,330 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-11-23 08:32:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-11-23 08:32:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-11-23 08:32:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-11-23 08:32:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-11-23 08:32:51,615 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-11-23 08:32:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:51,615 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-11-23 08:32:51,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-11-23 08:32:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:32:51,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:51,621 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-11-23 08:32:51,621 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:51,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-11-23 08:32:51,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:51,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:51,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:51,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:51,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:51,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:51,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:51,633 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-11-23 08:32:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:51,847 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-11-23 08:32:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:51,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 08:32:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:51,867 INFO L225 Difference]: With dead ends: 26636 [2018-11-23 08:32:51,867 INFO L226 Difference]: Without dead ends: 26634 [2018-11-23 08:32:51,872 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-11-23 08:32:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-11-23 08:32:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-11-23 08:32:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-11-23 08:32:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-11-23 08:32:52,208 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-11-23 08:32:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:52,209 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-11-23 08:32:52,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-11-23 08:32:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:32:52,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:52,220 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-11-23 08:32:52,220 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:52,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-11-23 08:32:52,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:52,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:52,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:52,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:52,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:52,245 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-11-23 08:32:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:52,506 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-11-23 08:32:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:52,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 08:32:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:52,526 INFO L225 Difference]: With dead ends: 55308 [2018-11-23 08:32:52,526 INFO L226 Difference]: Without dead ends: 31242 [2018-11-23 08:32:52,544 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-11-23 08:32:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-11-23 08:32:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-11-23 08:32:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-11-23 08:32:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-11-23 08:32:52,992 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-11-23 08:32:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:52,992 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-11-23 08:32:52,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-11-23 08:32:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 08:32:53,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:53,006 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-11-23 08:32:53,006 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:53,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-11-23 08:32:53,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:53,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:53,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:53,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:53,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:53,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:53,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:53,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:53,026 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-11-23 08:32:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:53,394 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-11-23 08:32:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:53,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 08:32:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:53,414 INFO L225 Difference]: With dead ends: 46860 [2018-11-23 08:32:53,414 INFO L226 Difference]: Without dead ends: 31754 [2018-11-23 08:32:53,425 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-11-23 08:32:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-11-23 08:32:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-11-23 08:32:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-11-23 08:32:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-11-23 08:32:53,811 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-11-23 08:32:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:53,811 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-11-23 08:32:53,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-11-23 08:32:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 08:32:53,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:53,821 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-11-23 08:32:53,822 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:53,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-11-23 08:32:53,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:53,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:53,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:53,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:53,853 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-11-23 08:32:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:54,398 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-11-23 08:32:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:54,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 08:32:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:54,428 INFO L225 Difference]: With dead ends: 51210 [2018-11-23 08:32:54,428 INFO L226 Difference]: Without dead ends: 51208 [2018-11-23 08:32:54,433 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-11-23 08:32:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-11-23 08:32:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-11-23 08:32:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-11-23 08:32:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-11-23 08:32:54,968 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-11-23 08:32:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:54,968 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-11-23 08:32:54,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-11-23 08:32:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 08:32:55,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:32:55,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:32:55,001 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:32:55,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:32:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-11-23 08:32:55,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:32:55,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:32:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:55,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:32:55,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:32:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:32:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:32:55,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:32:55,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:32:55,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:32:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:32:55,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:55,038 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-11-23 08:32:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:32:55,773 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-11-23 08:32:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:32:55,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 08:32:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:32:55,774 INFO L225 Difference]: With dead ends: 109576 [2018-11-23 08:32:55,774 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 08:32:55,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:32:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 08:32:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 08:32:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 08:32:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 08:32:55,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-23 08:32:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:32:55,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:32:55,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:32:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:32:55,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:32:55,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 08:32:55,859 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 08:32:55,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:32:55,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:32:55,859 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 08:32:55,859 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:32:55,859 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,860 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,861 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,862 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-23 08:32:55,863 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-23 08:32:55,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:32:55 BoogieIcfgContainer [2018-11-23 08:32:55,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:32:55,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:32:55,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:32:55,869 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:32:55,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:47" (3/4) ... [2018-11-23 08:32:55,872 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:32:55,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 08:32:55,878 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 08:32:55,882 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 08:32:55,883 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 08:32:55,883 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 08:32:55,930 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e607693-6275-4836-a6df-22648c48807d/bin-2019/uautomizer/witness.graphml [2018-11-23 08:32:55,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:32:55,931 INFO L168 Benchmark]: Toolchain (without parser) took 9271.08 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 867.7 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -226.5 MB). Peak memory consumption was 641.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:32:55,932 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:32:55,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.71 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:32:55,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.46 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:32:55,933 INFO L168 Benchmark]: Boogie Preprocessor took 50.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:32:55,933 INFO L168 Benchmark]: RCFGBuilder took 220.03 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:32:55,934 INFO L168 Benchmark]: TraceAbstraction took 8722.30 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 730.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.3 MB). Peak memory consumption was 650.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:32:55,934 INFO L168 Benchmark]: Witness Printer took 61.72 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-23 08:32:55,935 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.71 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 945.6 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.46 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 220.03 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8722.30 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 730.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.3 MB). Peak memory consumption was 650.0 MB. Max. memory is 11.5 GB. * Witness Printer took 61.72 ms. Allocated memory is still 1.9 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 8.6s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...