./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/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 b9ebacab53db4f4e6d9f51b7145688401913e247 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:45:23,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:45:23,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:45:23,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:45:23,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:45:23,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:45:23,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:45:23,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:45:23,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:45:23,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:45:23,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:45:23,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:45:23,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:45:23,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:45:23,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:45:23,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:45:23,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:45:23,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:45:23,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:45:23,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:45:23,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:45:23,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:45:23,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:45:23,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:45:23,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:45:23,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:45:23,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:45:23,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:45:23,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:45:23,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:45:23,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:45:23,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:45:23,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:45:23,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:45:23,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:45:23,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:45:23,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:45:23,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:45:23,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:45:23,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:45:23,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:45:23,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:45:23,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:45:23,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:45:23,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:45:23,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:45:23,353 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:45:23,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:45:23,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:45:23,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:45:23,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:45:23,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:45:23,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:45:23,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:45:23,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:45:23,355 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:45:23,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:45:23,355 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:45:23,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:45:23,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:45:23,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:45:23,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:45:23,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:45:23,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:45:23,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/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 -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-11-25 08:45:23,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:45:23,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:45:23,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:45:23,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:45:23,522 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:45:23,523 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-25 08:45:23,582 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/data/ca56e1abb/6ecc4348f12b4041bced6f115c10e0dc/FLAG89d8a85ac [2019-11-25 08:45:23,982 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:45:23,983 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-25 08:45:23,999 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/data/ca56e1abb/6ecc4348f12b4041bced6f115c10e0dc/FLAG89d8a85ac [2019-11-25 08:45:24,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/data/ca56e1abb/6ecc4348f12b4041bced6f115c10e0dc [2019-11-25 08:45:24,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:45:24,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:45:24,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:45:24,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:45:24,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c08adcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24, skipping insertion in model container [2019-11-25 08:45:24,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:45:24,406 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:45:24,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,737 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:45:24,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:45:24,806 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:45:24,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24 WrapperNode [2019-11-25 08:45:24,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:45:24,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:45:24,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:45:24,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:45:24,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:45:24,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:45:24,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... [2019-11-25 08:45:24,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:45:24,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:45:24,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:45:24,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:45:24,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/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 [2019-11-25 08:45:24,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:45:24,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:45:25,090 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:45:25,800 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:45:25,800 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:45:25,801 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:45:25,802 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:45:25,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25 BoogieIcfgContainer [2019-11-25 08:45:25,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:45:25,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:45:25,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:45:25,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:45:25,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:45:24" (1/3) ... [2019-11-25 08:45:25,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5400ff69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:45:24" (2/3) ... [2019-11-25 08:45:25,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5400ff69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:45:25, skipping insertion in model container [2019-11-25 08:45:25,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/3) ... [2019-11-25 08:45:25,810 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-25 08:45:25,817 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:45:25,824 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:45:25,834 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:45:25,857 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:45:25,857 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:45:25,857 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:45:25,858 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:45:25,858 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:45:25,858 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:45:25,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:45:25,858 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:45:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-11-25 08:45:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:45:25,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:25,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:25,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-11-25 08:45:25,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:25,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831057021] [2019-11-25 08:45:25,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831057021] [2019-11-25 08:45:26,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023570569] [2019-11-25 08:45:26,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,103 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-11-25 08:45:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,354 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-11-25 08:45:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:45:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,377 INFO L225 Difference]: With dead ends: 352 [2019-11-25 08:45:26,377 INFO L226 Difference]: Without dead ends: 173 [2019-11-25 08:45:26,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-25 08:45:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-11-25 08:45:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-25 08:45:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-11-25 08:45:26,430 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-11-25 08:45:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,430 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-11-25 08:45:26,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-11-25 08:45:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:45:26,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-11-25 08:45:26,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164213691] [2019-11-25 08:45:26,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164213691] [2019-11-25 08:45:26,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990217288] [2019-11-25 08:45:26,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,494 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-11-25 08:45:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,652 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-11-25 08:45:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:45:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,655 INFO L225 Difference]: With dead ends: 357 [2019-11-25 08:45:26,655 INFO L226 Difference]: Without dead ends: 193 [2019-11-25 08:45:26,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-25 08:45:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-25 08:45:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-25 08:45:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-11-25 08:45:26,673 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-11-25 08:45:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,673 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-11-25 08:45:26,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-11-25 08:45:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:45:26,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,675 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-11-25 08:45:26,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166099671] [2019-11-25 08:45:26,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:26,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166099671] [2019-11-25 08:45:26,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:26,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:26,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100000064] [2019-11-25 08:45:26,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:26,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,722 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-11-25 08:45:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:26,902 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-11-25 08:45:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:26,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:45:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:26,906 INFO L225 Difference]: With dead ends: 387 [2019-11-25 08:45:26,906 INFO L226 Difference]: Without dead ends: 201 [2019-11-25 08:45:26,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-25 08:45:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-11-25 08:45:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-25 08:45:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-11-25 08:45:26,932 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-11-25 08:45:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:26,932 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-11-25 08:45:26,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-11-25 08:45:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:45:26,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:26,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:26,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-11-25 08:45:26,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:26,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254866345] [2019-11-25 08:45:26,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254866345] [2019-11-25 08:45:27,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356844905] [2019-11-25 08:45:27,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,037 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-11-25 08:45:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,200 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-11-25 08:45:27,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:45:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,203 INFO L225 Difference]: With dead ends: 392 [2019-11-25 08:45:27,203 INFO L226 Difference]: Without dead ends: 200 [2019-11-25 08:45:27,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-25 08:45:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-11-25 08:45:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-25 08:45:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-11-25 08:45:27,221 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-11-25 08:45:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,221 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-11-25 08:45:27,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-11-25 08:45:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:45:27,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-11-25 08:45:27,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892334924] [2019-11-25 08:45:27,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892334924] [2019-11-25 08:45:27,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583612165] [2019-11-25 08:45:27,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,304 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-11-25 08:45:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,475 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-11-25 08:45:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-25 08:45:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,477 INFO L225 Difference]: With dead ends: 403 [2019-11-25 08:45:27,478 INFO L226 Difference]: Without dead ends: 210 [2019-11-25 08:45:27,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-25 08:45:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-25 08:45:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-25 08:45:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-11-25 08:45:27,489 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-11-25 08:45:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,490 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-11-25 08:45:27,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,490 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-11-25 08:45:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:45:27,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,492 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,492 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-11-25 08:45:27,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403097863] [2019-11-25 08:45:27,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403097863] [2019-11-25 08:45:27,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553879847] [2019-11-25 08:45:27,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,543 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-11-25 08:45:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,689 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-11-25 08:45:27,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-25 08:45:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,691 INFO L225 Difference]: With dead ends: 403 [2019-11-25 08:45:27,691 INFO L226 Difference]: Without dead ends: 210 [2019-11-25 08:45:27,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-25 08:45:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-25 08:45:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-25 08:45:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-11-25 08:45:27,702 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-11-25 08:45:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,702 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-11-25 08:45:27,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-11-25 08:45:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:45:27,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,705 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-11-25 08:45:27,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551396016] [2019-11-25 08:45:27,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551396016] [2019-11-25 08:45:27,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:27,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622719410] [2019-11-25 08:45:27,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:27,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:27,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,756 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-11-25 08:45:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:27,905 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-11-25 08:45:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:27,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-25 08:45:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:27,907 INFO L225 Difference]: With dead ends: 403 [2019-11-25 08:45:27,908 INFO L226 Difference]: Without dead ends: 210 [2019-11-25 08:45:27,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-25 08:45:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-25 08:45:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-25 08:45:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-11-25 08:45:27,918 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-11-25 08:45:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:27,918 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-11-25 08:45:27,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-11-25 08:45:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:45:27,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:27,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:27,920 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-11-25 08:45:27,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:27,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093765051] [2019-11-25 08:45:27,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093765051] [2019-11-25 08:45:27,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:27,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:27,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527251664] [2019-11-25 08:45:27,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:45:27,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:45:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:45:27,968 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-11-25 08:45:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,256 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-11-25 08:45:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:45:28,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-25 08:45:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,259 INFO L225 Difference]: With dead ends: 599 [2019-11-25 08:45:28,259 INFO L226 Difference]: Without dead ends: 406 [2019-11-25 08:45:28,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:45:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-25 08:45:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-11-25 08:45:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-25 08:45:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-11-25 08:45:28,276 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-11-25 08:45:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,277 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-11-25 08:45:28,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:45:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-11-25 08:45:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:45:28,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-11-25 08:45:28,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222101352] [2019-11-25 08:45:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222101352] [2019-11-25 08:45:28,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729508856] [2019-11-25 08:45:28,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,320 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-11-25 08:45:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,490 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-11-25 08:45:28,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-25 08:45:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,494 INFO L225 Difference]: With dead ends: 841 [2019-11-25 08:45:28,494 INFO L226 Difference]: Without dead ends: 466 [2019-11-25 08:45:28,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-25 08:45:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-11-25 08:45:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-25 08:45:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-11-25 08:45:28,512 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-11-25 08:45:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,512 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-11-25 08:45:28,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-11-25 08:45:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:45:28,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,514 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-11-25 08:45:28,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214375635] [2019-11-25 08:45:28,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214375635] [2019-11-25 08:45:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437067822] [2019-11-25 08:45:28,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,550 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-11-25 08:45:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,749 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-11-25 08:45:28,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:45:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,753 INFO L225 Difference]: With dead ends: 930 [2019-11-25 08:45:28,753 INFO L226 Difference]: Without dead ends: 489 [2019-11-25 08:45:28,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-25 08:45:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-11-25 08:45:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-25 08:45:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-11-25 08:45:28,774 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-11-25 08:45:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,774 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-11-25 08:45:28,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-11-25 08:45:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:45:28,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,776 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,776 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-11-25 08:45:28,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166034414] [2019-11-25 08:45:28,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:45:28,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166034414] [2019-11-25 08:45:28,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:28,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:28,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354407478] [2019-11-25 08:45:28,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:28,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,806 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-11-25 08:45:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:28,959 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-11-25 08:45:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:28,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-25 08:45:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:28,963 INFO L225 Difference]: With dead ends: 987 [2019-11-25 08:45:28,963 INFO L226 Difference]: Without dead ends: 523 [2019-11-25 08:45:28,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-25 08:45:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-25 08:45:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-25 08:45:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-11-25 08:45:28,983 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-11-25 08:45:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:28,984 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-11-25 08:45:28,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-11-25 08:45:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:45:28,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:28,985 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:28,986 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-11-25 08:45:28,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:28,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778597251] [2019-11-25 08:45:28,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:45:29,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778597251] [2019-11-25 08:45:29,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96062849] [2019-11-25 08:45:29,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,021 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-11-25 08:45:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,172 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-11-25 08:45:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-25 08:45:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,175 INFO L225 Difference]: With dead ends: 1021 [2019-11-25 08:45:29,176 INFO L226 Difference]: Without dead ends: 523 [2019-11-25 08:45:29,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-25 08:45:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-25 08:45:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-25 08:45:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-11-25 08:45:29,196 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-11-25 08:45:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,197 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-11-25 08:45:29,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-11-25 08:45:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:45:29,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,198 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,199 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-11-25 08:45:29,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308080921] [2019-11-25 08:45:29,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:45:29,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308080921] [2019-11-25 08:45:29,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157158230] [2019-11-25 08:45:29,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,237 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-11-25 08:45:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,397 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-11-25 08:45:29,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-25 08:45:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,401 INFO L225 Difference]: With dead ends: 1068 [2019-11-25 08:45:29,401 INFO L226 Difference]: Without dead ends: 570 [2019-11-25 08:45:29,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-25 08:45:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-11-25 08:45:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-25 08:45:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-11-25 08:45:29,425 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-11-25 08:45:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,426 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-11-25 08:45:29,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-11-25 08:45:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-25 08:45:29,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,428 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,428 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-11-25 08:45:29,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424206319] [2019-11-25 08:45:29,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:29,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424206319] [2019-11-25 08:45:29,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441797301] [2019-11-25 08:45:29,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,479 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-11-25 08:45:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,647 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-11-25 08:45:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-25 08:45:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,652 INFO L225 Difference]: With dead ends: 1178 [2019-11-25 08:45:29,652 INFO L226 Difference]: Without dead ends: 617 [2019-11-25 08:45:29,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-25 08:45:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-25 08:45:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-25 08:45:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-11-25 08:45:29,686 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-11-25 08:45:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,686 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-11-25 08:45:29,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-11-25 08:45:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-25 08:45:29,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,688 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,689 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-11-25 08:45:29,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005911935] [2019-11-25 08:45:29,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:45:29,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005911935] [2019-11-25 08:45:29,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:29,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:29,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627267692] [2019-11-25 08:45:29,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:29,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,744 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-11-25 08:45:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:29,938 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-11-25 08:45:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:29,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-25 08:45:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:29,943 INFO L225 Difference]: With dead ends: 1221 [2019-11-25 08:45:29,943 INFO L226 Difference]: Without dead ends: 617 [2019-11-25 08:45:29,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-25 08:45:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-25 08:45:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-25 08:45:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-11-25 08:45:29,978 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-11-25 08:45:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:29,978 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-11-25 08:45:29,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-11-25 08:45:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:45:29,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:29,981 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:29,981 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-11-25 08:45:29,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:29,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751268982] [2019-11-25 08:45:29,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:45:30,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751268982] [2019-11-25 08:45:30,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777961113] [2019-11-25 08:45:30,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,058 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-11-25 08:45:30,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,231 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-11-25 08:45:30,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:45:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,235 INFO L225 Difference]: With dead ends: 1217 [2019-11-25 08:45:30,235 INFO L226 Difference]: Without dead ends: 613 [2019-11-25 08:45:30,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-25 08:45:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-11-25 08:45:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-25 08:45:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-11-25 08:45:30,262 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-11-25 08:45:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,262 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-11-25 08:45:30,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-11-25 08:45:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:45:30,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,264 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-11-25 08:45:30,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842089884] [2019-11-25 08:45:30,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-25 08:45:30,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842089884] [2019-11-25 08:45:30,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150494026] [2019-11-25 08:45:30,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,315 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-11-25 08:45:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,477 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-11-25 08:45:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-25 08:45:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,481 INFO L225 Difference]: With dead ends: 1275 [2019-11-25 08:45:30,482 INFO L226 Difference]: Without dead ends: 671 [2019-11-25 08:45:30,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-25 08:45:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-25 08:45:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-25 08:45:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-11-25 08:45:30,514 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-11-25 08:45:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,515 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-11-25 08:45:30,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-11-25 08:45:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-25 08:45:30,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,517 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,517 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-11-25 08:45:30,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251492382] [2019-11-25 08:45:30,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-25 08:45:30,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251492382] [2019-11-25 08:45:30,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601498409] [2019-11-25 08:45:30,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,560 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-11-25 08:45:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:30,795 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-11-25 08:45:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:30,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-25 08:45:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:30,799 INFO L225 Difference]: With dead ends: 1307 [2019-11-25 08:45:30,800 INFO L226 Difference]: Without dead ends: 671 [2019-11-25 08:45:30,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-25 08:45:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-25 08:45:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-25 08:45:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-11-25 08:45:30,831 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-11-25 08:45:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:30,832 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-11-25 08:45:30,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-11-25 08:45:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-25 08:45:30,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:30,834 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:30,834 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-11-25 08:45:30,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:30,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391660844] [2019-11-25 08:45:30,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:45:30,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391660844] [2019-11-25 08:45:30,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:30,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:30,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483547736] [2019-11-25 08:45:30,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:30,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:30,868 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-11-25 08:45:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,050 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-11-25 08:45:31,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-25 08:45:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,055 INFO L225 Difference]: With dead ends: 1343 [2019-11-25 08:45:31,055 INFO L226 Difference]: Without dead ends: 707 [2019-11-25 08:45:31,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-25 08:45:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-11-25 08:45:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-25 08:45:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-11-25 08:45:31,083 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-11-25 08:45:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,084 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-11-25 08:45:31,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-11-25 08:45:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:45:31,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,086 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,086 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-11-25 08:45:31,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863253094] [2019-11-25 08:45:31,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:45:31,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863253094] [2019-11-25 08:45:31,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189033013] [2019-11-25 08:45:31,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,121 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-11-25 08:45:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,301 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-11-25 08:45:31,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:45:31,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,305 INFO L225 Difference]: With dead ends: 1400 [2019-11-25 08:45:31,305 INFO L226 Difference]: Without dead ends: 708 [2019-11-25 08:45:31,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-25 08:45:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-11-25 08:45:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-25 08:45:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-11-25 08:45:31,334 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-11-25 08:45:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,334 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-11-25 08:45:31,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-11-25 08:45:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-25 08:45:31,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,337 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,337 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-11-25 08:45:31,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088618311] [2019-11-25 08:45:31,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:45:31,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088618311] [2019-11-25 08:45:31,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675614016] [2019-11-25 08:45:31,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,371 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-11-25 08:45:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,539 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-11-25 08:45:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-25 08:45:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,544 INFO L225 Difference]: With dead ends: 1432 [2019-11-25 08:45:31,544 INFO L226 Difference]: Without dead ends: 743 [2019-11-25 08:45:31,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-25 08:45:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-25 08:45:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-25 08:45:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-11-25 08:45:31,573 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-11-25 08:45:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,573 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-11-25 08:45:31,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-11-25 08:45:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-25 08:45:31,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,576 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,576 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-11-25 08:45:31,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895079096] [2019-11-25 08:45:31,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-25 08:45:31,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895079096] [2019-11-25 08:45:31,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807811571] [2019-11-25 08:45:31,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,615 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-11-25 08:45:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:31,814 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-11-25 08:45:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:31,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-25 08:45:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:31,820 INFO L225 Difference]: With dead ends: 1473 [2019-11-25 08:45:31,820 INFO L226 Difference]: Without dead ends: 743 [2019-11-25 08:45:31,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-25 08:45:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-25 08:45:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-25 08:45:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-11-25 08:45:31,857 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-11-25 08:45:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:31,857 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-11-25 08:45:31,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-11-25 08:45:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-25 08:45:31,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:31,860 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:31,860 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-11-25 08:45:31,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:31,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464098201] [2019-11-25 08:45:31,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-25 08:45:31,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464098201] [2019-11-25 08:45:31,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:31,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:31,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419056569] [2019-11-25 08:45:31,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:31,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:31,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:31,922 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-11-25 08:45:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,082 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-11-25 08:45:32,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-25 08:45:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,087 INFO L225 Difference]: With dead ends: 1509 [2019-11-25 08:45:32,087 INFO L226 Difference]: Without dead ends: 779 [2019-11-25 08:45:32,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-25 08:45:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-25 08:45:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-25 08:45:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-11-25 08:45:32,124 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-11-25 08:45:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,125 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-11-25 08:45:32,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-11-25 08:45:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-25 08:45:32,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,127 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:32,127 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-11-25 08:45:32,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890261729] [2019-11-25 08:45:32,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-25 08:45:32,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890261729] [2019-11-25 08:45:32,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512917505] [2019-11-25 08:45:32,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,170 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-11-25 08:45:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,327 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-11-25 08:45:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-25 08:45:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,331 INFO L225 Difference]: With dead ends: 1541 [2019-11-25 08:45:32,331 INFO L226 Difference]: Without dead ends: 779 [2019-11-25 08:45:32,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-25 08:45:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-25 08:45:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-25 08:45:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-11-25 08:45:32,362 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-11-25 08:45:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,362 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-11-25 08:45:32,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-11-25 08:45:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-25 08:45:32,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,365 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:32,365 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-11-25 08:45:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160352270] [2019-11-25 08:45:32,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-25 08:45:32,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160352270] [2019-11-25 08:45:32,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363568615] [2019-11-25 08:45:32,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,423 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-11-25 08:45:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,571 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-11-25 08:45:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-25 08:45:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,576 INFO L225 Difference]: With dead ends: 1567 [2019-11-25 08:45:32,576 INFO L226 Difference]: Without dead ends: 805 [2019-11-25 08:45:32,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-25 08:45:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-25 08:45:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-25 08:45:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-11-25 08:45:32,609 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-11-25 08:45:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,609 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-11-25 08:45:32,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-11-25 08:45:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-25 08:45:32,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,612 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:32,612 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-11-25 08:45:32,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106321586] [2019-11-25 08:45:32,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,659 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-25 08:45:32,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106321586] [2019-11-25 08:45:32,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274482244] [2019-11-25 08:45:32,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,661 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-11-25 08:45:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:32,822 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-11-25 08:45:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:32,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-25 08:45:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:32,826 INFO L225 Difference]: With dead ends: 1595 [2019-11-25 08:45:32,827 INFO L226 Difference]: Without dead ends: 805 [2019-11-25 08:45:32,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-25 08:45:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-25 08:45:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-25 08:45:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-11-25 08:45:32,865 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-11-25 08:45:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:32,865 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-11-25 08:45:32,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-11-25 08:45:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-25 08:45:32,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:32,868 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:32,871 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-11-25 08:45:32,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:32,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537797195] [2019-11-25 08:45:32,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-25 08:45:32,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537797195] [2019-11-25 08:45:32,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:32,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:32,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350814832] [2019-11-25 08:45:32,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:32,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:32,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:32,927 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-11-25 08:45:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,162 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-11-25 08:45:33,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-25 08:45:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,168 INFO L225 Difference]: With dead ends: 1650 [2019-11-25 08:45:33,168 INFO L226 Difference]: Without dead ends: 860 [2019-11-25 08:45:33,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-25 08:45:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-11-25 08:45:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-25 08:45:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-11-25 08:45:33,209 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-11-25 08:45:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,209 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-11-25 08:45:33,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-11-25 08:45:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-25 08:45:33,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,213 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:33,213 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-11-25 08:45:33,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348944350] [2019-11-25 08:45:33,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-25 08:45:33,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348944350] [2019-11-25 08:45:33,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:33,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332051333] [2019-11-25 08:45:33,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,264 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-11-25 08:45:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,455 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-11-25 08:45:33,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-25 08:45:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,460 INFO L225 Difference]: With dead ends: 1699 [2019-11-25 08:45:33,460 INFO L226 Difference]: Without dead ends: 844 [2019-11-25 08:45:33,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-11-25 08:45:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-11-25 08:45:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-25 08:45:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-11-25 08:45:33,501 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-11-25 08:45:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,501 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-11-25 08:45:33,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-11-25 08:45:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-25 08:45:33,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,503 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:33,504 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-11-25 08:45:33,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566231114] [2019-11-25 08:45:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-25 08:45:33,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566231114] [2019-11-25 08:45:33,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:33,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50652439] [2019-11-25 08:45:33,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,580 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-11-25 08:45:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:33,751 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-11-25 08:45:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:33,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-25 08:45:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:33,756 INFO L225 Difference]: With dead ends: 1665 [2019-11-25 08:45:33,757 INFO L226 Difference]: Without dead ends: 842 [2019-11-25 08:45:33,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-25 08:45:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-11-25 08:45:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-25 08:45:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-11-25 08:45:33,789 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-11-25 08:45:33,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:33,789 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-11-25 08:45:33,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-11-25 08:45:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:45:33,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:33,792 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:33,793 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-11-25 08:45:33,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:33,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676639887] [2019-11-25 08:45:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-25 08:45:33,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676639887] [2019-11-25 08:45:33,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:33,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:45:33,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311320916] [2019-11-25 08:45:33,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:33,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:33,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:33,852 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-11-25 08:45:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,029 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-11-25 08:45:34,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-25 08:45:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,034 INFO L225 Difference]: With dead ends: 1665 [2019-11-25 08:45:34,034 INFO L226 Difference]: Without dead ends: 825 [2019-11-25 08:45:34,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-25 08:45:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-11-25 08:45:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-25 08:45:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-11-25 08:45:34,068 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-11-25 08:45:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,068 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-11-25 08:45:34,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-11-25 08:45:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-25 08:45:34,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,071 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,071 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-11-25 08:45:34,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194508796] [2019-11-25 08:45:34,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-25 08:45:34,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194508796] [2019-11-25 08:45:34,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240533729] [2019-11-25 08:45:34,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,119 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-11-25 08:45:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,177 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-11-25 08:45:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-25 08:45:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,187 INFO L225 Difference]: With dead ends: 2411 [2019-11-25 08:45:34,187 INFO L226 Difference]: Without dead ends: 1605 [2019-11-25 08:45:34,189 INFO L630 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 [2019-11-25 08:45:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-11-25 08:45:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-11-25 08:45:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-25 08:45:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-11-25 08:45:34,236 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-11-25 08:45:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,237 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-11-25 08:45:34,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-11-25 08:45:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-25 08:45:34,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,239 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,240 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-11-25 08:45:34,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934460097] [2019-11-25 08:45:34,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-25 08:45:34,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934460097] [2019-11-25 08:45:34,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063792129] [2019-11-25 08:45:34,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,325 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-11-25 08:45:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,391 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-11-25 08:45:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-25 08:45:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,400 INFO L225 Difference]: With dead ends: 2410 [2019-11-25 08:45:34,400 INFO L226 Difference]: Without dead ends: 1602 [2019-11-25 08:45:34,402 INFO L630 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 [2019-11-25 08:45:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-11-25 08:45:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-11-25 08:45:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-25 08:45:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-11-25 08:45:34,468 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-11-25 08:45:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,468 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-11-25 08:45:34,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-11-25 08:45:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-25 08:45:34,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,471 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,471 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-11-25 08:45:34,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076108842] [2019-11-25 08:45:34,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-25 08:45:34,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076108842] [2019-11-25 08:45:34,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837504862] [2019-11-25 08:45:34,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,614 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-11-25 08:45:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:34,769 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-11-25 08:45:34,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:34,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-25 08:45:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:34,786 INFO L225 Difference]: With dead ends: 4746 [2019-11-25 08:45:34,786 INFO L226 Difference]: Without dead ends: 3153 [2019-11-25 08:45:34,789 INFO L630 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 [2019-11-25 08:45:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-11-25 08:45:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-11-25 08:45:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-25 08:45:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-11-25 08:45:34,884 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-11-25 08:45:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:34,885 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-11-25 08:45:34,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-11-25 08:45:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:45:34,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:34,887 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:34,888 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-11-25 08:45:34,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:34,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790170357] [2019-11-25 08:45:34,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:45:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-25 08:45:34,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790170357] [2019-11-25 08:45:34,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:45:34,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:45:34,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075447731] [2019-11-25 08:45:34,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:45:34,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:45:34,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:45:34,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:45:34,943 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-11-25 08:45:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:45:35,222 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-11-25 08:45:35,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:45:35,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-25 08:45:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:45:35,247 INFO L225 Difference]: With dead ends: 4786 [2019-11-25 08:45:35,253 INFO L226 Difference]: Without dead ends: 3193 [2019-11-25 08:45:35,256 INFO L630 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 [2019-11-25 08:45:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-25 08:45:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-11-25 08:45:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-11-25 08:45:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-11-25 08:45:35,478 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-11-25 08:45:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:45:35,478 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-11-25 08:45:35,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:45:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-11-25 08:45:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:45:35,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:45:35,482 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:45:35,482 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:45:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:45:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-11-25 08:45:35,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:45:35,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130968018] [2019-11-25 08:45:35,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:45:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:45:35,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:45:35,624 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:45:35,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:45:35 BoogieIcfgContainer [2019-11-25 08:45:35,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:45:35,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:45:35,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:45:35,722 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:45:35,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:45:25" (3/4) ... [2019-11-25 08:45:35,724 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:45:35,867 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c186d96f-3984-4c32-ba3e-8b8d1775ca03/bin/uautomizer/witness.graphml [2019-11-25 08:45:35,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:45:35,870 INFO L168 Benchmark]: Toolchain (without parser) took 11544.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 421.5 MB). Free memory was 944.8 MB in the beginning and 1.3 GB in the end (delta: -369.1 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:35,870 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:45:35,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:35,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.15 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. [2019-11-25 08:45:35,871 INFO L168 Benchmark]: Boogie Preprocessor took 38.96 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. [2019-11-25 08:45:35,872 INFO L168 Benchmark]: RCFGBuilder took 899.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.0 MB). Peak memory consumption was 70.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:35,872 INFO L168 Benchmark]: TraceAbstraction took 9916.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:35,872 INFO L168 Benchmark]: Witness Printer took 146.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:45:35,874 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 481.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.15 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. * Boogie Preprocessor took 38.96 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. * RCFGBuilder took 899.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.0 MB). Peak memory consumption was 70.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9916.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -285.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Witness Printer took 146.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...