./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/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 f2cbbf56a13532141372a32a461d64a9d1351c0e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:43:45,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:43:45,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:43:45,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:43:45,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:43:45,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:43:45,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:43:45,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:43:45,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:43:45,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:43:45,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:43:45,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:43:45,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:43:45,088 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:43:45,089 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:43:45,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:43:45,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:43:45,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:43:45,092 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:43:45,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:43:45,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:43:45,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:43:45,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:43:45,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:43:45,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:43:45,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:43:45,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:43:45,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:43:45,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:43:45,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:43:45,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:43:45,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:43:45,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:43:45,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:43:45,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:43:45,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:43:45,100 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:43:45,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:43:45,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:43:45,108 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:43:45,108 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:43:45,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:43:45,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:43:45,109 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:43:45,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:43:45,109 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:43:45,109 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:43:45,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:43:45,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:43:45,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:43:45,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:43:45,110 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:43:45,110 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:43:45,111 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:43:45,111 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:43:45,111 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:43:45,111 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:43:45,111 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:43:45,111 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:43:45,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:43:45,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:43:45,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:43:45,112 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:43:45,112 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:43:45,112 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:43:45,112 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:43:45,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:43:45,113 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_3c6655bf-a084-4fd0-8c2c-9add352673c8/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-28 11:43:45,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:43:45,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:43:45,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:43:45,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:43:45,150 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:43:45,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:43:45,190 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/data/631d4d55f/12240f2ee8c147eb925029daee1026cd/FLAG184643518 [2018-11-28 11:43:45,537 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:43:45,538 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:43:45,543 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/data/631d4d55f/12240f2ee8c147eb925029daee1026cd/FLAG184643518 [2018-11-28 11:43:45,961 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/data/631d4d55f/12240f2ee8c147eb925029daee1026cd [2018-11-28 11:43:45,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:43:45,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:43:45,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:43:45,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:43:45,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:43:45,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:43:45" (1/1) ... [2018-11-28 11:43:45,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4c1343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:45, skipping insertion in model container [2018-11-28 11:43:45,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:43:45" (1/1) ... [2018-11-28 11:43:45,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:43:45,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:43:46,089 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:43:46,092 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:43:46,109 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:43:46,118 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:43:46,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46 WrapperNode [2018-11-28 11:43:46,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:43:46,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:43:46,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:43:46,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:43:46,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:43:46,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:43:46,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:43:46,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:43:46,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... [2018-11-28 11:43:46,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:43:46,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:43:46,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:43:46,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:43:46,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/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-28 11:43:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:43:46,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:43:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:43:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:43:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:43:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:43:46,375 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:43:46,376 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:43:46,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:43:46 BoogieIcfgContainer [2018-11-28 11:43:46,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:43:46,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:43:46,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:43:46,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:43:46,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:43:45" (1/3) ... [2018-11-28 11:43:46,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2267983b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:43:46, skipping insertion in model container [2018-11-28 11:43:46,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:43:46" (2/3) ... [2018-11-28 11:43:46,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2267983b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:43:46, skipping insertion in model container [2018-11-28 11:43:46,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:43:46" (3/3) ... [2018-11-28 11:43:46,382 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 11:43:46,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:43:46,393 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:43:46,402 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:43:46,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:43:46,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:43:46,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:43:46,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:43:46,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:43:46,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:43:46,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:43:46,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:43:46,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:43:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-28 11:43:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:43:46,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-11-28 11:43:46,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:46,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:46,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:46,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:46,582 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-11-28 11:43:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:46,619 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-11-28 11:43:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:46,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 11:43:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:46,626 INFO L225 Difference]: With dead ends: 75 [2018-11-28 11:43:46,626 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 11:43:46,628 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-28 11:43:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 11:43:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-28 11:43:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 11:43:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-11-28 11:43:46,654 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-11-28 11:43:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:46,654 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-11-28 11:43:46,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-11-28 11:43:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 11:43:46,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-11-28 11:43:46,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,692 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-28 11:43:46,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:46,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:46,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:46,695 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-11-28 11:43:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:46,720 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-11-28 11:43:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:46,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-28 11:43:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:46,721 INFO L225 Difference]: With dead ends: 97 [2018-11-28 11:43:46,721 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 11:43:46,722 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-28 11:43:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 11:43:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-28 11:43:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 11:43:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-11-28 11:43:46,726 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-11-28 11:43:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:46,726 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-11-28 11:43:46,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-11-28 11:43:46,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:43:46,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,727 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,727 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-11-28 11:43:46,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,771 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-28 11:43:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:46,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:46,772 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-11-28 11:43:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:46,793 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-28 11:43:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:46,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 11:43:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:46,794 INFO L225 Difference]: With dead ends: 90 [2018-11-28 11:43:46,794 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 11:43:46,794 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-28 11:43:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 11:43:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-28 11:43:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 11:43:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-11-28 11:43:46,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-11-28 11:43:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:46,798 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-11-28 11:43:46,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-11-28 11:43:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:43:46,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-11-28 11:43:46,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,836 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-28 11:43:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:46,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:46,837 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-11-28 11:43:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:46,849 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-11-28 11:43:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:46,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 11:43:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:46,850 INFO L225 Difference]: With dead ends: 112 [2018-11-28 11:43:46,851 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 11:43:46,851 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-28 11:43:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 11:43:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-11-28 11:43:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 11:43:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-11-28 11:43:46,856 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-11-28 11:43:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:46,856 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-11-28 11:43:46,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-11-28 11:43:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:43:46,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-11-28 11:43:46,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:46,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:46,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:46,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:46,877 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-11-28 11:43:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:46,917 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-11-28 11:43:46,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:46,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-28 11:43:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:46,918 INFO L225 Difference]: With dead ends: 184 [2018-11-28 11:43:46,918 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 11:43:46,919 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-28 11:43:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 11:43:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-28 11:43:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 11:43:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-11-28 11:43:46,932 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-11-28 11:43:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:46,932 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-11-28 11:43:46,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-11-28 11:43:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:43:46,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-11-28 11:43:46,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,954 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-28 11:43:46,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:46,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:46,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:46,955 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-11-28 11:43:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:46,974 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-11-28 11:43:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:46,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 11:43:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:46,975 INFO L225 Difference]: With dead ends: 165 [2018-11-28 11:43:46,975 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 11:43:46,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-28 11:43:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 11:43:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-28 11:43:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 11:43:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-11-28 11:43:46,981 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-11-28 11:43:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:46,981 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-11-28 11:43:46,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-11-28 11:43:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:43:46,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:46,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:46,982 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:46,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-11-28 11:43:46,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:46,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:46,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:46,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,007 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-28 11:43:47,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,008 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-11-28 11:43:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,032 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-11-28 11:43:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 11:43:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,034 INFO L225 Difference]: With dead ends: 204 [2018-11-28 11:43:47,034 INFO L226 Difference]: Without dead ends: 202 [2018-11-28 11:43:47,034 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-28 11:43:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-28 11:43:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-11-28 11:43:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-28 11:43:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-11-28 11:43:47,043 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-11-28 11:43:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,043 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-11-28 11:43:47,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-11-28 11:43:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:43:47,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:47,045 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-11-28 11:43:47,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,069 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-28 11:43:47,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,070 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-11-28 11:43:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,095 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-11-28 11:43:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 11:43:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,096 INFO L225 Difference]: With dead ends: 352 [2018-11-28 11:43:47,096 INFO L226 Difference]: Without dead ends: 210 [2018-11-28 11:43:47,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-28 11:43:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-11-28 11:43:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-28 11:43:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-11-28 11:43:47,108 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-11-28 11:43:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,109 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-11-28 11:43:47,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-11-28 11:43:47,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:43:47,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,110 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-28 11:43:47,112 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-11-28 11:43:47,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,135 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-28 11:43:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,136 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-11-28 11:43:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,162 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-28 11:43:47,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 11:43:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,164 INFO L225 Difference]: With dead ends: 312 [2018-11-28 11:43:47,164 INFO L226 Difference]: Without dead ends: 214 [2018-11-28 11:43:47,164 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-28 11:43:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-28 11:43:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-11-28 11:43:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-28 11:43:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-11-28 11:43:47,171 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-11-28 11:43:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,171 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-11-28 11:43:47,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-11-28 11:43:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:43:47,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,172 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-28 11:43:47,172 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-11-28 11:43:47,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:47,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,201 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-11-28 11:43:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,219 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-11-28 11:43:47,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 11:43:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,221 INFO L225 Difference]: With dead ends: 380 [2018-11-28 11:43:47,222 INFO L226 Difference]: Without dead ends: 378 [2018-11-28 11:43:47,222 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-28 11:43:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-28 11:43:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-11-28 11:43:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-28 11:43:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-11-28 11:43:47,231 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-11-28 11:43:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,231 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-11-28 11:43:47,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-11-28 11:43:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:43:47,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,232 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-28 11:43:47,232 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-11-28 11:43:47,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,252 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-28 11:43:47,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,253 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-11-28 11:43:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,267 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-11-28 11:43:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 11:43:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,269 INFO L225 Difference]: With dead ends: 684 [2018-11-28 11:43:47,269 INFO L226 Difference]: Without dead ends: 402 [2018-11-28 11:43:47,270 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-28 11:43:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-28 11:43:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-11-28 11:43:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-28 11:43:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-11-28 11:43:47,281 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-11-28 11:43:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,281 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-11-28 11:43:47,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-11-28 11:43:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:43:47,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,282 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-28 11:43:47,283 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-11-28 11:43:47,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,303 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-28 11:43:47,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,304 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-11-28 11:43:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,320 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-11-28 11:43:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 11:43:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,322 INFO L225 Difference]: With dead ends: 600 [2018-11-28 11:43:47,322 INFO L226 Difference]: Without dead ends: 410 [2018-11-28 11:43:47,323 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-28 11:43:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-28 11:43:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-11-28 11:43:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-28 11:43:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-11-28 11:43:47,338 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-11-28 11:43:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,338 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-11-28 11:43:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-11-28 11:43:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:43:47,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,340 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-28 11:43:47,340 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-11-28 11:43:47,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,367 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-28 11:43:47,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,368 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-11-28 11:43:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,398 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-11-28 11:43:47,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 11:43:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,400 INFO L225 Difference]: With dead ends: 716 [2018-11-28 11:43:47,401 INFO L226 Difference]: Without dead ends: 714 [2018-11-28 11:43:47,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-28 11:43:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-28 11:43:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-11-28 11:43:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-28 11:43:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-11-28 11:43:47,419 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-11-28 11:43:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,420 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-11-28 11:43:47,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-11-28 11:43:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:43:47,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,421 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-28 11:43:47,421 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,422 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-11-28 11:43:47,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,444 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-28 11:43:47,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,447 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-11-28 11:43:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,497 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-11-28 11:43:47,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 11:43:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,499 INFO L225 Difference]: With dead ends: 1340 [2018-11-28 11:43:47,500 INFO L226 Difference]: Without dead ends: 778 [2018-11-28 11:43: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-28 11:43:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-28 11:43:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-11-28 11:43:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-28 11:43:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-11-28 11:43:47,527 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-11-28 11:43:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,528 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-11-28 11:43:47,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-11-28 11:43:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:43:47,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,529 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-28 11:43:47,529 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-11-28 11:43:47,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,560 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-28 11:43:47,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,561 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-11-28 11:43:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,597 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-11-28 11:43:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 11:43:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,600 INFO L225 Difference]: With dead ends: 1164 [2018-11-28 11:43:47,600 INFO L226 Difference]: Without dead ends: 794 [2018-11-28 11:43:47,601 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-28 11:43:47,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-28 11:43:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-28 11:43:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-28 11:43:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-11-28 11:43:47,628 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-11-28 11:43:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,628 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-11-28 11:43:47,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-11-28 11:43:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:43:47,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,630 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-28 11:43:47,630 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-11-28 11:43:47,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,646 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-28 11:43:47,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,648 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-11-28 11:43:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,683 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-11-28 11:43:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 11:43:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,687 INFO L225 Difference]: With dead ends: 1356 [2018-11-28 11:43:47,687 INFO L226 Difference]: Without dead ends: 1354 [2018-11-28 11:43:47,688 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-28 11:43:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-28 11:43:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-11-28 11:43:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-28 11:43:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-11-28 11:43:47,725 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-11-28 11:43:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,725 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-11-28 11:43:47,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-11-28 11:43:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 11:43:47,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,727 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-28 11:43:47,727 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-11-28 11:43:47,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,748 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-28 11:43:47,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,750 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-11-28 11:43:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,793 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-11-28 11:43:47,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 11:43:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,798 INFO L225 Difference]: With dead ends: 2636 [2018-11-28 11:43:47,798 INFO L226 Difference]: Without dead ends: 1514 [2018-11-28 11:43:47,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-11-28 11:43:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-11-28 11:43:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-11-28 11:43:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-11-28 11:43:47,854 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-11-28 11:43:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,855 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-11-28 11:43:47,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-11-28 11:43:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:43:47,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43: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-28 11:43:47,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-11-28 11:43:47,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:47,891 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-28 11:43:47,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:47,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:47,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:47,893 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-11-28 11:43:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:47,942 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-11-28 11:43:47,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:47,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:43:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:47,947 INFO L225 Difference]: With dead ends: 2268 [2018-11-28 11:43:47,947 INFO L226 Difference]: Without dead ends: 1546 [2018-11-28 11:43:47,948 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-28 11:43:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-28 11:43:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-11-28 11:43:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-28 11:43:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-11-28 11:43:47,993 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-11-28 11:43:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:47,993 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-11-28 11:43:47,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-11-28 11:43:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:43:47,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:47,995 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-28 11:43:47,995 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:47,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-11-28 11:43:47,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,015 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-28 11:43:48,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:48,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,016 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-11-28 11:43:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,070 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-11-28 11:43:48,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:48,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:43:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,077 INFO L225 Difference]: With dead ends: 2572 [2018-11-28 11:43:48,077 INFO L226 Difference]: Without dead ends: 2570 [2018-11-28 11:43:48,078 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-28 11:43:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-11-28 11:43:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-11-28 11:43:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-28 11:43:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-11-28 11:43:48,138 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-11-28 11:43:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,138 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-11-28 11:43:48,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-11-28 11:43:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:43:48,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,141 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-28 11:43:48,141 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:48,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-11-28 11:43:48,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,155 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-28 11:43:48,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:48,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,156 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-11-28 11:43:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,223 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-11-28 11:43:48,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:48,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 11:43:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,230 INFO L225 Difference]: With dead ends: 5196 [2018-11-28 11:43:48,230 INFO L226 Difference]: Without dead ends: 2954 [2018-11-28 11:43:48,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-28 11:43:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-11-28 11:43:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-11-28 11:43:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-11-28 11:43:48,321 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-11-28 11:43:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,321 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-11-28 11:43:48,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-11-28 11:43:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:43:48,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,324 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-28 11:43:48,325 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:48,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-11-28 11:43:48,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,339 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-28 11:43:48,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:48,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,340 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-11-28 11:43:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,414 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-11-28 11:43:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:48,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:43:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,422 INFO L225 Difference]: With dead ends: 4428 [2018-11-28 11:43:48,422 INFO L226 Difference]: Without dead ends: 3018 [2018-11-28 11:43:48,424 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-28 11:43:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-11-28 11:43:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-11-28 11:43:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-28 11:43:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-11-28 11:43:48,519 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-11-28 11:43:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,520 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-11-28 11:43:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-11-28 11:43:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:43:48,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,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] [2018-11-28 11:43:48,523 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:48,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-11-28 11:43:48,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,540 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-28 11:43:48,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:48,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:48,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,541 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-11-28 11:43:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,660 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-11-28 11:43:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:48,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:43:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,668 INFO L225 Difference]: With dead ends: 8650 [2018-11-28 11:43:48,668 INFO L226 Difference]: Without dead ends: 3016 [2018-11-28 11:43:48,674 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-28 11:43:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-11-28 11:43:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-11-28 11:43:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-28 11:43:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-11-28 11:43:48,741 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-11-28 11:43:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,742 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-11-28 11:43:48,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-28 11:43:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:43:48,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:48,744 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-28 11:43:48,744 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:48,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-11-28 11:43:48,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:48,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:48,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:48,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:48,759 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-28 11:43:48,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:43:48,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:43:48,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:43:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:43:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:43:48,760 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-11-28 11:43:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:48,802 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-28 11:43:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:43:48,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:43:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:48,802 INFO L225 Difference]: With dead ends: 3016 [2018-11-28 11:43:48,803 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 11:43:48,805 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-28 11:43:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 11:43:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 11:43:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 11:43:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 11:43:48,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-28 11:43:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:48,806 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:43:48,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:43:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:43:48,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 11:43:48,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 11:43:48,826 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 11:43:48,826 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-28 11:43:48,826 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,827 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-28 11:43:48,828 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-28 11:43:48,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:43:48 BoogieIcfgContainer [2018-11-28 11:43:48,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:43:48,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:43:48,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:43:48,834 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:43:48,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:43:46" (3/4) ... [2018-11-28 11:43:48,837 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 11:43:48,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 11:43:48,842 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 11:43:48,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 11:43:48,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 11:43:48,846 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 11:43:48,883 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c6655bf-a084-4fd0-8c2c-9add352673c8/bin-2019/uautomizer/witness.graphml [2018-11-28 11:43:48,883 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:43:48,884 INFO L168 Benchmark]: Toolchain (without parser) took 2920.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:48,885 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:43:48,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.33 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:48,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.91 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:43:48,886 INFO L168 Benchmark]: Boogie Preprocessor took 52.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:48,886 INFO L168 Benchmark]: RCFGBuilder took 192.74 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-28 11:43:48,886 INFO L168 Benchmark]: TraceAbstraction took 2456.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.1 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2018-11-28 11:43:48,887 INFO L168 Benchmark]: Witness Printer took 49.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:43:48,888 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.33 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.91 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.74 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 2456.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -15.1 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * Witness Printer took 49.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 38 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...