./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/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 129b0578c0c64625cef50fbcfd5d128651ff3275 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:48:16,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:48:16,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:48:16,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:48:16,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:48:16,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:48:16,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:48:16,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:48:16,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:48:16,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:48:16,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:48:16,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:48:16,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:48:16,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:48:16,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:48:16,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:48:16,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:48:16,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:48:16,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:48:16,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:48:16,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:48:16,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:48:16,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:48:16,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:48:16,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:48:16,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:48:16,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:48:16,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:48:16,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:48:16,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:48:16,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:48:16,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:48:16,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:48:16,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:48:16,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:48:16,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:48:16,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:48:16,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:48:16,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:48:16,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:48:16,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:48:16,330 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:48:16,339 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:48:16,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:48:16,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:48:16,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:48:16,340 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:48:16,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:48:16,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:48:16,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:48:16,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:48:16,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:48:16,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:48:16,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:48:16,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:48:16,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:48:16,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:48:16,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:48:16,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:48:16,344 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_163304e5-a0c1-4ead-af20-8899e39ba768/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2019-12-07 15:48:16,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:48:16,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:48:16,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:48:16,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:48:16,454 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:48:16,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_15-2.c [2019-12-07 15:48:16,502 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/data/e5237145d/40f7b13885004179b9e883491b2b44c5/FLAG2a0cda3c6 [2019-12-07 15:48:16,825 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:48:16,825 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/sv-benchmarks/c/locks/test_locks_15-2.c [2019-12-07 15:48:16,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/data/e5237145d/40f7b13885004179b9e883491b2b44c5/FLAG2a0cda3c6 [2019-12-07 15:48:16,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/data/e5237145d/40f7b13885004179b9e883491b2b44c5 [2019-12-07 15:48:16,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:48:16,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:48:16,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:16,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:48:16,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:48:16,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:16" (1/1) ... [2019-12-07 15:48:16,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:16, skipping insertion in model container [2019-12-07 15:48:16,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:16" (1/1) ... [2019-12-07 15:48:16,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:48:16,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:48:17,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:17,038 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:48:17,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:17,071 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:48:17,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17 WrapperNode [2019-12-07 15:48:17,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:17,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:17,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:48:17,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:48:17,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:17,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:48:17,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:48:17,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:48:17,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... [2019-12-07 15:48:17,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:48:17,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:48:17,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:48:17,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:48:17,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/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-12-07 15:48:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:48:17,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:48:17,360 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:48:17,361 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 15:48:17,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:17 BoogieIcfgContainer [2019-12-07 15:48:17,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:48:17,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:48:17,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:48:17,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:48:17,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:48:16" (1/3) ... [2019-12-07 15:48:17,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c45eb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:48:17, skipping insertion in model container [2019-12-07 15:48:17,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:17" (2/3) ... [2019-12-07 15:48:17,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c45eb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:48:17, skipping insertion in model container [2019-12-07 15:48:17,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:17" (3/3) ... [2019-12-07 15:48:17,366 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-12-07 15:48:17,372 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:48:17,377 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:48:17,385 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:48:17,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:48:17,401 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:48:17,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:48:17,401 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:48:17,401 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:48:17,401 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:48:17,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:48:17,401 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:48:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-12-07 15:48:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:48:17,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,415 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] [2019-12-07 15:48:17,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1323177046, now seen corresponding path program 1 times [2019-12-07 15:48:17,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852168018] [2019-12-07 15:48:17,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852168018] [2019-12-07 15:48:17,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535348172] [2019-12-07 15:48:17,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,567 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-12-07 15:48:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,601 INFO L93 Difference]: Finished difference Result 112 states and 204 transitions. [2019-12-07 15:48:17,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 15:48:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,610 INFO L225 Difference]: With dead ends: 112 [2019-12-07 15:48:17,610 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 15:48:17,612 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-12-07 15:48:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 15:48:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2019-12-07 15:48:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 15:48:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 125 transitions. [2019-12-07 15:48:17,639 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 125 transitions. Word has length 21 [2019-12-07 15:48:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 125 transitions. [2019-12-07 15:48:17,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 125 transitions. [2019-12-07 15:48:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:48:17,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,640 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] [2019-12-07 15:48:17,641 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -670967660, now seen corresponding path program 1 times [2019-12-07 15:48:17,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960483235] [2019-12-07 15:48:17,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960483235] [2019-12-07 15:48:17,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718133068] [2019-12-07 15:48:17,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,679 INFO L87 Difference]: Start difference. First operand 66 states and 125 transitions. Second operand 3 states. [2019-12-07 15:48:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,696 INFO L93 Difference]: Finished difference Result 163 states and 308 transitions. [2019-12-07 15:48:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 15:48:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,698 INFO L225 Difference]: With dead ends: 163 [2019-12-07 15:48:17,698 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 15:48:17,699 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-12-07 15:48:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 15:48:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-12-07 15:48:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 15:48:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 181 transitions. [2019-12-07 15:48:17,706 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 181 transitions. Word has length 21 [2019-12-07 15:48:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,706 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 181 transitions. [2019-12-07 15:48:17,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 181 transitions. [2019-12-07 15:48:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:48:17,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,707 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] [2019-12-07 15:48:17,707 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1930972807, now seen corresponding path program 1 times [2019-12-07 15:48:17,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954646093] [2019-12-07 15:48:17,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954646093] [2019-12-07 15:48:17,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733299282] [2019-12-07 15:48:17,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,738 INFO L87 Difference]: Start difference. First operand 96 states and 181 transitions. Second operand 3 states. [2019-12-07 15:48:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,752 INFO L93 Difference]: Finished difference Result 149 states and 275 transitions. [2019-12-07 15:48:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 15:48:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,754 INFO L225 Difference]: With dead ends: 149 [2019-12-07 15:48:17,754 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 15:48:17,754 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-12-07 15:48:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 15:48:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-12-07 15:48:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 15:48:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 183 transitions. [2019-12-07 15:48:17,761 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 183 transitions. Word has length 22 [2019-12-07 15:48:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,761 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 183 transitions. [2019-12-07 15:48:17,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 183 transitions. [2019-12-07 15:48:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:48:17,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,762 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] [2019-12-07 15:48:17,762 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash 675050747, now seen corresponding path program 1 times [2019-12-07 15:48:17,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072371566] [2019-12-07 15:48:17,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072371566] [2019-12-07 15:48:17,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391949170] [2019-12-07 15:48:17,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,794 INFO L87 Difference]: Start difference. First operand 99 states and 183 transitions. Second operand 3 states. [2019-12-07 15:48:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,807 INFO L93 Difference]: Finished difference Result 192 states and 356 transitions. [2019-12-07 15:48:17,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 15:48:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,809 INFO L225 Difference]: With dead ends: 192 [2019-12-07 15:48:17,809 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 15:48:17,809 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-12-07 15:48:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 15:48:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 132. [2019-12-07 15:48:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 15:48:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 244 transitions. [2019-12-07 15:48:17,817 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 244 transitions. Word has length 22 [2019-12-07 15:48:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,817 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 244 transitions. [2019-12-07 15:48:17,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 244 transitions. [2019-12-07 15:48:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:48:17,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,819 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] [2019-12-07 15:48:17,819 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1319093959, now seen corresponding path program 1 times [2019-12-07 15:48:17,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368262267] [2019-12-07 15:48:17,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368262267] [2019-12-07 15:48:17,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502126111] [2019-12-07 15:48:17,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,840 INFO L87 Difference]: Start difference. First operand 132 states and 244 transitions. Second operand 3 states. [2019-12-07 15:48:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,852 INFO L93 Difference]: Finished difference Result 320 states and 594 transitions. [2019-12-07 15:48:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 15:48:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,854 INFO L225 Difference]: With dead ends: 320 [2019-12-07 15:48:17,854 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 15:48:17,855 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-12-07 15:48:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 15:48:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-12-07 15:48:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-07 15:48:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 350 transitions. [2019-12-07 15:48:17,867 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 350 transitions. Word has length 22 [2019-12-07 15:48:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,867 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 350 transitions. [2019-12-07 15:48:17,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 350 transitions. [2019-12-07 15:48:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:48:17,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,869 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] [2019-12-07 15:48:17,869 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash -548051255, now seen corresponding path program 1 times [2019-12-07 15:48:17,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717399697] [2019-12-07 15:48:17,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717399697] [2019-12-07 15:48:17,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265156222] [2019-12-07 15:48:17,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,890 INFO L87 Difference]: Start difference. First operand 190 states and 350 transitions. Second operand 3 states. [2019-12-07 15:48:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,899 INFO L93 Difference]: Finished difference Result 287 states and 525 transitions. [2019-12-07 15:48:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 15:48:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,901 INFO L225 Difference]: With dead ends: 287 [2019-12-07 15:48:17,901 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 15:48:17,901 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-12-07 15:48:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 15:48:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2019-12-07 15:48:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-07 15:48:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 350 transitions. [2019-12-07 15:48:17,908 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 350 transitions. Word has length 23 [2019-12-07 15:48:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,908 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 350 transitions. [2019-12-07 15:48:17,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 350 transitions. [2019-12-07 15:48:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:48:17,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,909 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] [2019-12-07 15:48:17,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2057972299, now seen corresponding path program 1 times [2019-12-07 15:48:17,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707021212] [2019-12-07 15:48:17,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707021212] [2019-12-07 15:48:17,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766140891] [2019-12-07 15:48:17,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,928 INFO L87 Difference]: Start difference. First operand 192 states and 350 transitions. Second operand 3 states. [2019-12-07 15:48:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,943 INFO L93 Difference]: Finished difference Result 560 states and 1024 transitions. [2019-12-07 15:48:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 15:48:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,945 INFO L225 Difference]: With dead ends: 560 [2019-12-07 15:48:17,945 INFO L226 Difference]: Without dead ends: 374 [2019-12-07 15:48:17,946 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-12-07 15:48:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-07 15:48:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2019-12-07 15:48:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-07 15:48:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 674 transitions. [2019-12-07 15:48:17,955 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 674 transitions. Word has length 23 [2019-12-07 15:48:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:17,956 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 674 transitions. [2019-12-07 15:48:17,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 674 transitions. [2019-12-07 15:48:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 15:48:17,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:17,957 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] [2019-12-07 15:48:17,957 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -242850291, now seen corresponding path program 1 times [2019-12-07 15:48:17,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:17,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953361992] [2019-12-07 15:48:17,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:17,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953361992] [2019-12-07 15:48:17,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:17,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:17,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374705913] [2019-12-07 15:48:17,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:17,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:17,978 INFO L87 Difference]: Start difference. First operand 372 states and 674 transitions. Second operand 3 states. [2019-12-07 15:48:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:17,993 INFO L93 Difference]: Finished difference Result 480 states and 876 transitions. [2019-12-07 15:48:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:17,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 15:48:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:17,996 INFO L225 Difference]: With dead ends: 480 [2019-12-07 15:48:17,996 INFO L226 Difference]: Without dead ends: 478 [2019-12-07 15:48:17,997 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-12-07 15:48:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-12-07 15:48:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 372. [2019-12-07 15:48:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-12-07 15:48:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 670 transitions. [2019-12-07 15:48:18,007 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 670 transitions. Word has length 23 [2019-12-07 15:48:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,007 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 670 transitions. [2019-12-07 15:48:18,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 670 transitions. [2019-12-07 15:48:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 15:48:18,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,008 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] [2019-12-07 15:48:18,008 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,008 INFO L82 PathProgramCache]: Analyzing trace with hash -627155762, now seen corresponding path program 1 times [2019-12-07 15:48:18,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034237942] [2019-12-07 15:48:18,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034237942] [2019-12-07 15:48:18,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3156147] [2019-12-07 15:48:18,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,028 INFO L87 Difference]: Start difference. First operand 372 states and 670 transitions. Second operand 3 states. [2019-12-07 15:48:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,045 INFO L93 Difference]: Finished difference Result 708 states and 1288 transitions. [2019-12-07 15:48:18,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 15:48:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,050 INFO L225 Difference]: With dead ends: 708 [2019-12-07 15:48:18,050 INFO L226 Difference]: Without dead ends: 706 [2019-12-07 15:48:18,051 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-12-07 15:48:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-12-07 15:48:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 512. [2019-12-07 15:48:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 15:48:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 910 transitions. [2019-12-07 15:48:18,067 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 910 transitions. Word has length 24 [2019-12-07 15:48:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,068 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 910 transitions. [2019-12-07 15:48:18,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 910 transitions. [2019-12-07 15:48:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 15:48:18,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,069 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] [2019-12-07 15:48:18,070 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1673666828, now seen corresponding path program 1 times [2019-12-07 15:48:18,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99907599] [2019-12-07 15:48:18,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99907599] [2019-12-07 15:48:18,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073820438] [2019-12-07 15:48:18,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,087 INFO L87 Difference]: Start difference. First operand 512 states and 910 transitions. Second operand 3 states. [2019-12-07 15:48:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,108 INFO L93 Difference]: Finished difference Result 1236 states and 2208 transitions. [2019-12-07 15:48:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 15:48:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,111 INFO L225 Difference]: With dead ends: 1236 [2019-12-07 15:48:18,112 INFO L226 Difference]: Without dead ends: 730 [2019-12-07 15:48:18,112 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-12-07 15:48:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-12-07 15:48:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 728. [2019-12-07 15:48:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-12-07 15:48:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1290 transitions. [2019-12-07 15:48:18,126 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1290 transitions. Word has length 24 [2019-12-07 15:48:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,126 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 1290 transitions. [2019-12-07 15:48:18,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1290 transitions. [2019-12-07 15:48:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:48:18,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,127 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] [2019-12-07 15:48:18,128 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2033220608, now seen corresponding path program 1 times [2019-12-07 15:48:18,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47986253] [2019-12-07 15:48:18,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47986253] [2019-12-07 15:48:18,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372705376] [2019-12-07 15:48:18,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,142 INFO L87 Difference]: Start difference. First operand 728 states and 1290 transitions. Second operand 3 states. [2019-12-07 15:48:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,156 INFO L93 Difference]: Finished difference Result 1100 states and 1944 transitions. [2019-12-07 15:48:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 15:48:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,161 INFO L225 Difference]: With dead ends: 1100 [2019-12-07 15:48:18,161 INFO L226 Difference]: Without dead ends: 742 [2019-12-07 15:48:18,162 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-12-07 15:48:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-12-07 15:48:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2019-12-07 15:48:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-12-07 15:48:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1298 transitions. [2019-12-07 15:48:18,183 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1298 transitions. Word has length 25 [2019-12-07 15:48:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,183 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 1298 transitions. [2019-12-07 15:48:18,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1298 transitions. [2019-12-07 15:48:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:48:18,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,185 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] [2019-12-07 15:48:18,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash 344276866, now seen corresponding path program 1 times [2019-12-07 15:48:18,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611055362] [2019-12-07 15:48:18,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611055362] [2019-12-07 15:48:18,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716373865] [2019-12-07 15:48:18,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,206 INFO L87 Difference]: Start difference. First operand 740 states and 1298 transitions. Second operand 3 states. [2019-12-07 15:48:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,225 INFO L93 Difference]: Finished difference Result 1384 states and 2460 transitions. [2019-12-07 15:48:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 15:48:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,233 INFO L225 Difference]: With dead ends: 1384 [2019-12-07 15:48:18,233 INFO L226 Difference]: Without dead ends: 1382 [2019-12-07 15:48:18,234 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-12-07 15:48:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-07 15:48:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1028. [2019-12-07 15:48:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-12-07 15:48:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1770 transitions. [2019-12-07 15:48:18,265 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1770 transitions. Word has length 25 [2019-12-07 15:48:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,265 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1770 transitions. [2019-12-07 15:48:18,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1770 transitions. [2019-12-07 15:48:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:48:18,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,267 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] [2019-12-07 15:48:18,267 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1649867840, now seen corresponding path program 1 times [2019-12-07 15:48:18,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760233324] [2019-12-07 15:48:18,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760233324] [2019-12-07 15:48:18,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412905782] [2019-12-07 15:48:18,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,283 INFO L87 Difference]: Start difference. First operand 1028 states and 1770 transitions. Second operand 3 states. [2019-12-07 15:48:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,311 INFO L93 Difference]: Finished difference Result 2456 states and 4252 transitions. [2019-12-07 15:48:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 15:48:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,317 INFO L225 Difference]: With dead ends: 2456 [2019-12-07 15:48:18,317 INFO L226 Difference]: Without dead ends: 1446 [2019-12-07 15:48:18,318 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-12-07 15:48:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2019-12-07 15:48:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1444. [2019-12-07 15:48:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-07 15:48:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2482 transitions. [2019-12-07 15:48:18,349 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2482 transitions. Word has length 25 [2019-12-07 15:48:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,350 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2482 transitions. [2019-12-07 15:48:18,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2482 transitions. [2019-12-07 15:48:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:48:18,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,351 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] [2019-12-07 15:48:18,351 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2082861345, now seen corresponding path program 1 times [2019-12-07 15:48:18,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165977107] [2019-12-07 15:48:18,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165977107] [2019-12-07 15:48:18,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922695479] [2019-12-07 15:48:18,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,368 INFO L87 Difference]: Start difference. First operand 1444 states and 2482 transitions. Second operand 3 states. [2019-12-07 15:48:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,387 INFO L93 Difference]: Finished difference Result 2168 states and 3716 transitions. [2019-12-07 15:48:18,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 15:48:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,394 INFO L225 Difference]: With dead ends: 2168 [2019-12-07 15:48:18,394 INFO L226 Difference]: Without dead ends: 1462 [2019-12-07 15:48:18,395 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-12-07 15:48:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-12-07 15:48:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2019-12-07 15:48:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-12-07 15:48:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2482 transitions. [2019-12-07 15:48:18,427 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2482 transitions. Word has length 26 [2019-12-07 15:48:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,427 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2482 transitions. [2019-12-07 15:48:18,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2482 transitions. [2019-12-07 15:48:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:48:18,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,429 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] [2019-12-07 15:48:18,429 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 393917603, now seen corresponding path program 1 times [2019-12-07 15:48:18,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760648286] [2019-12-07 15:48:18,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760648286] [2019-12-07 15:48:18,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316551040] [2019-12-07 15:48:18,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,445 INFO L87 Difference]: Start difference. First operand 1460 states and 2482 transitions. Second operand 3 states. [2019-12-07 15:48:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,479 INFO L93 Difference]: Finished difference Result 2696 states and 4660 transitions. [2019-12-07 15:48:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 15:48:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,490 INFO L225 Difference]: With dead ends: 2696 [2019-12-07 15:48:18,490 INFO L226 Difference]: Without dead ends: 2694 [2019-12-07 15:48:18,491 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-12-07 15:48:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-12-07 15:48:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2052. [2019-12-07 15:48:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-12-07 15:48:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3410 transitions. [2019-12-07 15:48:18,528 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3410 transitions. Word has length 26 [2019-12-07 15:48:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,528 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3410 transitions. [2019-12-07 15:48:18,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3410 transitions. [2019-12-07 15:48:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:48:18,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,530 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] [2019-12-07 15:48:18,530 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1600227103, now seen corresponding path program 1 times [2019-12-07 15:48:18,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129107726] [2019-12-07 15:48:18,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129107726] [2019-12-07 15:48:18,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597068855] [2019-12-07 15:48:18,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,544 INFO L87 Difference]: Start difference. First operand 2052 states and 3410 transitions. Second operand 3 states. [2019-12-07 15:48:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,574 INFO L93 Difference]: Finished difference Result 4872 states and 8148 transitions. [2019-12-07 15:48:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 15:48:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,585 INFO L225 Difference]: With dead ends: 4872 [2019-12-07 15:48:18,585 INFO L226 Difference]: Without dead ends: 2854 [2019-12-07 15:48:18,588 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-12-07 15:48:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2019-12-07 15:48:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2852. [2019-12-07 15:48:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-12-07 15:48:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4738 transitions. [2019-12-07 15:48:18,638 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4738 transitions. Word has length 26 [2019-12-07 15:48:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,638 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 4738 transitions. [2019-12-07 15:48:18,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4738 transitions. [2019-12-07 15:48:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:48:18,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,640 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-12-07 15:48:18,640 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash -673242763, now seen corresponding path program 1 times [2019-12-07 15:48:18,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966143736] [2019-12-07 15:48:18,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966143736] [2019-12-07 15:48:18,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606432266] [2019-12-07 15:48:18,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,655 INFO L87 Difference]: Start difference. First operand 2852 states and 4738 transitions. Second operand 3 states. [2019-12-07 15:48:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,695 INFO L93 Difference]: Finished difference Result 4280 states and 7092 transitions. [2019-12-07 15:48:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 15:48:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,710 INFO L225 Difference]: With dead ends: 4280 [2019-12-07 15:48:18,710 INFO L226 Difference]: Without dead ends: 2886 [2019-12-07 15:48:18,712 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-12-07 15:48:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-12-07 15:48:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2884. [2019-12-07 15:48:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2884 states. [2019-12-07 15:48:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4738 transitions. [2019-12-07 15:48:18,787 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4738 transitions. Word has length 27 [2019-12-07 15:48:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,787 INFO L462 AbstractCegarLoop]: Abstraction has 2884 states and 4738 transitions. [2019-12-07 15:48:18,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4738 transitions. [2019-12-07 15:48:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:48:18,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,790 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-12-07 15:48:18,791 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1932780791, now seen corresponding path program 1 times [2019-12-07 15:48:18,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288106488] [2019-12-07 15:48:18,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288106488] [2019-12-07 15:48:18,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567928601] [2019-12-07 15:48:18,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,809 INFO L87 Difference]: Start difference. First operand 2884 states and 4738 transitions. Second operand 3 states. [2019-12-07 15:48:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:18,869 INFO L93 Difference]: Finished difference Result 5256 states and 8804 transitions. [2019-12-07 15:48:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:18,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 15:48:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:18,892 INFO L225 Difference]: With dead ends: 5256 [2019-12-07 15:48:18,892 INFO L226 Difference]: Without dead ends: 5254 [2019-12-07 15:48:18,893 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-12-07 15:48:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-12-07 15:48:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 4100. [2019-12-07 15:48:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-12-07 15:48:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 6562 transitions. [2019-12-07 15:48:18,965 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 6562 transitions. Word has length 27 [2019-12-07 15:48:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:18,965 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 6562 transitions. [2019-12-07 15:48:18,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6562 transitions. [2019-12-07 15:48:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:48:18,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:18,969 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-12-07 15:48:18,969 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash -61363915, now seen corresponding path program 1 times [2019-12-07 15:48:18,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:18,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961578223] [2019-12-07 15:48:18,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:18,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961578223] [2019-12-07 15:48:18,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:18,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:18,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918186215] [2019-12-07 15:48:18,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:18,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:18,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:18,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:18,984 INFO L87 Difference]: Start difference. First operand 4100 states and 6562 transitions. Second operand 3 states. [2019-12-07 15:48:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:19,034 INFO L93 Difference]: Finished difference Result 9672 states and 15588 transitions. [2019-12-07 15:48:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:19,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 15:48:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:19,053 INFO L225 Difference]: With dead ends: 9672 [2019-12-07 15:48:19,053 INFO L226 Difference]: Without dead ends: 5638 [2019-12-07 15:48:19,057 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-12-07 15:48:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-12-07 15:48:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5636. [2019-12-07 15:48:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5636 states. [2019-12-07 15:48:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5636 states to 5636 states and 9026 transitions. [2019-12-07 15:48:19,150 INFO L78 Accepts]: Start accepts. Automaton has 5636 states and 9026 transitions. Word has length 27 [2019-12-07 15:48:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:19,150 INFO L462 AbstractCegarLoop]: Abstraction has 5636 states and 9026 transitions. [2019-12-07 15:48:19,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5636 states and 9026 transitions. [2019-12-07 15:48:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:48:19,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:19,154 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-12-07 15:48:19,154 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -213123850, now seen corresponding path program 1 times [2019-12-07 15:48:19,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:19,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283952614] [2019-12-07 15:48:19,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:19,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283952614] [2019-12-07 15:48:19,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:19,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:19,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709911194] [2019-12-07 15:48:19,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:19,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:19,184 INFO L87 Difference]: Start difference. First operand 5636 states and 9026 transitions. Second operand 3 states. [2019-12-07 15:48:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:19,222 INFO L93 Difference]: Finished difference Result 8456 states and 13508 transitions. [2019-12-07 15:48:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:19,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 15:48:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:19,229 INFO L225 Difference]: With dead ends: 8456 [2019-12-07 15:48:19,230 INFO L226 Difference]: Without dead ends: 5702 [2019-12-07 15:48:19,233 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-12-07 15:48:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2019-12-07 15:48:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5700. [2019-12-07 15:48:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-12-07 15:48:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 9026 transitions. [2019-12-07 15:48:19,314 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 9026 transitions. Word has length 28 [2019-12-07 15:48:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:19,315 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 9026 transitions. [2019-12-07 15:48:19,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 9026 transitions. [2019-12-07 15:48:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:48:19,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:19,319 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-12-07 15:48:19,319 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1902067592, now seen corresponding path program 1 times [2019-12-07 15:48:19,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:19,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985958556] [2019-12-07 15:48:19,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:19,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985958556] [2019-12-07 15:48:19,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:19,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:19,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038865351] [2019-12-07 15:48:19,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:19,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:19,337 INFO L87 Difference]: Start difference. First operand 5700 states and 9026 transitions. Second operand 3 states. [2019-12-07 15:48:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:19,399 INFO L93 Difference]: Finished difference Result 10248 states and 16580 transitions. [2019-12-07 15:48:19,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:19,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 15:48:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:19,415 INFO L225 Difference]: With dead ends: 10248 [2019-12-07 15:48:19,415 INFO L226 Difference]: Without dead ends: 10246 [2019-12-07 15:48:19,418 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-12-07 15:48:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10246 states. [2019-12-07 15:48:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10246 to 8196. [2019-12-07 15:48:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-07 15:48:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 12610 transitions. [2019-12-07 15:48:19,528 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 12610 transitions. Word has length 28 [2019-12-07 15:48:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:19,529 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 12610 transitions. [2019-12-07 15:48:19,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 12610 transitions. [2019-12-07 15:48:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:48:19,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:19,536 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-12-07 15:48:19,536 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 398754998, now seen corresponding path program 1 times [2019-12-07 15:48:19,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:19,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881609619] [2019-12-07 15:48:19,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:19,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881609619] [2019-12-07 15:48:19,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:19,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:19,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772640017] [2019-12-07 15:48:19,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:19,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:19,551 INFO L87 Difference]: Start difference. First operand 8196 states and 12610 transitions. Second operand 3 states. [2019-12-07 15:48:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:19,631 INFO L93 Difference]: Finished difference Result 19208 states and 29764 transitions. [2019-12-07 15:48:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:19,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 15:48:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:19,651 INFO L225 Difference]: With dead ends: 19208 [2019-12-07 15:48:19,651 INFO L226 Difference]: Without dead ends: 11142 [2019-12-07 15:48:19,661 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-12-07 15:48:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-07 15:48:19,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 11140. [2019-12-07 15:48:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11140 states. [2019-12-07 15:48:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 17154 transitions. [2019-12-07 15:48:19,828 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 17154 transitions. Word has length 28 [2019-12-07 15:48:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:19,828 INFO L462 AbstractCegarLoop]: Abstraction has 11140 states and 17154 transitions. [2019-12-07 15:48:19,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 17154 transitions. [2019-12-07 15:48:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:48:19,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:19,835 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-12-07 15:48:19,835 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1165660906, now seen corresponding path program 1 times [2019-12-07 15:48:19,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:19,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113243047] [2019-12-07 15:48:19,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:19,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113243047] [2019-12-07 15:48:19,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:19,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:19,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210945039] [2019-12-07 15:48:19,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:19,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:19,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:19,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:19,848 INFO L87 Difference]: Start difference. First operand 11140 states and 17154 transitions. Second operand 3 states. [2019-12-07 15:48:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:19,912 INFO L93 Difference]: Finished difference Result 16712 states and 25668 transitions. [2019-12-07 15:48:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:19,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 15:48:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:19,925 INFO L225 Difference]: With dead ends: 16712 [2019-12-07 15:48:19,925 INFO L226 Difference]: Without dead ends: 11270 [2019-12-07 15:48:19,931 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-12-07 15:48:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-12-07 15:48:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11268. [2019-12-07 15:48:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11268 states. [2019-12-07 15:48:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11268 states to 11268 states and 17154 transitions. [2019-12-07 15:48:20,061 INFO L78 Accepts]: Start accepts. Automaton has 11268 states and 17154 transitions. Word has length 29 [2019-12-07 15:48:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:20,061 INFO L462 AbstractCegarLoop]: Abstraction has 11268 states and 17154 transitions. [2019-12-07 15:48:20,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 11268 states and 17154 transitions. [2019-12-07 15:48:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:48:20,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:20,068 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-12-07 15:48:20,068 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash -523282836, now seen corresponding path program 1 times [2019-12-07 15:48:20,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:20,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128899191] [2019-12-07 15:48:20,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:20,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128899191] [2019-12-07 15:48:20,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:20,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:20,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330543617] [2019-12-07 15:48:20,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:20,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:20,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:20,081 INFO L87 Difference]: Start difference. First operand 11268 states and 17154 transitions. Second operand 3 states. [2019-12-07 15:48:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:20,165 INFO L93 Difference]: Finished difference Result 19976 states and 31108 transitions. [2019-12-07 15:48:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:20,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 15:48:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:20,190 INFO L225 Difference]: With dead ends: 19976 [2019-12-07 15:48:20,190 INFO L226 Difference]: Without dead ends: 19974 [2019-12-07 15:48:20,193 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-12-07 15:48:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19974 states. [2019-12-07 15:48:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19974 to 16388. [2019-12-07 15:48:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16388 states. [2019-12-07 15:48:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16388 states to 16388 states and 24194 transitions. [2019-12-07 15:48:20,378 INFO L78 Accepts]: Start accepts. Automaton has 16388 states and 24194 transitions. Word has length 29 [2019-12-07 15:48:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:20,378 INFO L462 AbstractCegarLoop]: Abstraction has 16388 states and 24194 transitions. [2019-12-07 15:48:20,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16388 states and 24194 transitions. [2019-12-07 15:48:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 15:48:20,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:20,389 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-12-07 15:48:20,389 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1777539754, now seen corresponding path program 1 times [2019-12-07 15:48:20,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:20,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914964184] [2019-12-07 15:48:20,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:20,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914964184] [2019-12-07 15:48:20,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:20,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:20,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464584885] [2019-12-07 15:48:20,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:20,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:20,402 INFO L87 Difference]: Start difference. First operand 16388 states and 24194 transitions. Second operand 3 states. [2019-12-07 15:48:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:20,511 INFO L93 Difference]: Finished difference Result 38152 states and 56708 transitions. [2019-12-07 15:48:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:20,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 15:48:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:20,529 INFO L225 Difference]: With dead ends: 38152 [2019-12-07 15:48:20,529 INFO L226 Difference]: Without dead ends: 22022 [2019-12-07 15:48:20,541 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-12-07 15:48:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2019-12-07 15:48:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 22020. [2019-12-07 15:48:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22020 states. [2019-12-07 15:48:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22020 states to 22020 states and 32514 transitions. [2019-12-07 15:48:20,763 INFO L78 Accepts]: Start accepts. Automaton has 22020 states and 32514 transitions. Word has length 29 [2019-12-07 15:48:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:20,763 INFO L462 AbstractCegarLoop]: Abstraction has 22020 states and 32514 transitions. [2019-12-07 15:48:20,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 22020 states and 32514 transitions. [2019-12-07 15:48:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 15:48:20,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:20,776 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-12-07 15:48:20,777 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash 958315723, now seen corresponding path program 1 times [2019-12-07 15:48:20,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:20,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274874598] [2019-12-07 15:48:20,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:20,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274874598] [2019-12-07 15:48:20,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:20,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:20,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227356908] [2019-12-07 15:48:20,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:20,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:20,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:20,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:20,794 INFO L87 Difference]: Start difference. First operand 22020 states and 32514 transitions. Second operand 3 states. [2019-12-07 15:48:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:20,934 INFO L93 Difference]: Finished difference Result 33032 states and 48644 transitions. [2019-12-07 15:48:20,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:20,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 15:48:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:20,950 INFO L225 Difference]: With dead ends: 33032 [2019-12-07 15:48:20,950 INFO L226 Difference]: Without dead ends: 22278 [2019-12-07 15:48:20,957 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-12-07 15:48:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22278 states. [2019-12-07 15:48:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22278 to 22276. [2019-12-07 15:48:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22276 states. [2019-12-07 15:48:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22276 states to 22276 states and 32514 transitions. [2019-12-07 15:48:21,167 INFO L78 Accepts]: Start accepts. Automaton has 22276 states and 32514 transitions. Word has length 30 [2019-12-07 15:48:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:21,167 INFO L462 AbstractCegarLoop]: Abstraction has 22276 states and 32514 transitions. [2019-12-07 15:48:21,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22276 states and 32514 transitions. [2019-12-07 15:48:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 15:48:21,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:21,178 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-12-07 15:48:21,178 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -730628019, now seen corresponding path program 1 times [2019-12-07 15:48:21,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:21,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184921656] [2019-12-07 15:48:21,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:21,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184921656] [2019-12-07 15:48:21,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:21,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:21,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527800270] [2019-12-07 15:48:21,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:21,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:21,191 INFO L87 Difference]: Start difference. First operand 22276 states and 32514 transitions. Second operand 3 states. [2019-12-07 15:48:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:21,346 INFO L93 Difference]: Finished difference Result 38920 states and 58116 transitions. [2019-12-07 15:48:21,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:21,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 15:48:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:21,377 INFO L225 Difference]: With dead ends: 38920 [2019-12-07 15:48:21,377 INFO L226 Difference]: Without dead ends: 38918 [2019-12-07 15:48:21,383 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-12-07 15:48:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38918 states. [2019-12-07 15:48:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38918 to 32772. [2019-12-07 15:48:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32772 states. [2019-12-07 15:48:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32772 states to 32772 states and 46338 transitions. [2019-12-07 15:48:21,718 INFO L78 Accepts]: Start accepts. Automaton has 32772 states and 46338 transitions. Word has length 30 [2019-12-07 15:48:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:21,719 INFO L462 AbstractCegarLoop]: Abstraction has 32772 states and 46338 transitions. [2019-12-07 15:48:21,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 32772 states and 46338 transitions. [2019-12-07 15:48:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 15:48:21,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:21,732 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-12-07 15:48:21,732 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:21,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1570194571, now seen corresponding path program 1 times [2019-12-07 15:48:21,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:21,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027172593] [2019-12-07 15:48:21,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:21,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027172593] [2019-12-07 15:48:21,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:21,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:21,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063879735] [2019-12-07 15:48:21,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:21,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:21,747 INFO L87 Difference]: Start difference. First operand 32772 states and 46338 transitions. Second operand 3 states. [2019-12-07 15:48:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:21,978 INFO L93 Difference]: Finished difference Result 75784 states and 107780 transitions. [2019-12-07 15:48:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:21,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 15:48:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:22,009 INFO L225 Difference]: With dead ends: 75784 [2019-12-07 15:48:22,010 INFO L226 Difference]: Without dead ends: 43526 [2019-12-07 15:48:22,027 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-12-07 15:48:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43526 states. [2019-12-07 15:48:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43526 to 43524. [2019-12-07 15:48:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43524 states. [2019-12-07 15:48:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43524 states to 43524 states and 61442 transitions. [2019-12-07 15:48:22,539 INFO L78 Accepts]: Start accepts. Automaton has 43524 states and 61442 transitions. Word has length 30 [2019-12-07 15:48:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:22,540 INFO L462 AbstractCegarLoop]: Abstraction has 43524 states and 61442 transitions. [2019-12-07 15:48:22,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 43524 states and 61442 transitions. [2019-12-07 15:48:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:48:22,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:22,553 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-12-07 15:48:22,553 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1174417313, now seen corresponding path program 1 times [2019-12-07 15:48:22,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:22,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589178949] [2019-12-07 15:48:22,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:22,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589178949] [2019-12-07 15:48:22,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:22,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:22,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333540332] [2019-12-07 15:48:22,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:22,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:22,571 INFO L87 Difference]: Start difference. First operand 43524 states and 61442 transitions. Second operand 3 states. [2019-12-07 15:48:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:22,788 INFO L93 Difference]: Finished difference Result 65288 states and 91908 transitions. [2019-12-07 15:48:22,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:22,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 15:48:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:22,821 INFO L225 Difference]: With dead ends: 65288 [2019-12-07 15:48:22,821 INFO L226 Difference]: Without dead ends: 44038 [2019-12-07 15:48:22,832 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-12-07 15:48:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44038 states. [2019-12-07 15:48:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44038 to 44036. [2019-12-07 15:48:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44036 states. [2019-12-07 15:48:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44036 states to 44036 states and 61442 transitions. [2019-12-07 15:48:23,339 INFO L78 Accepts]: Start accepts. Automaton has 44036 states and 61442 transitions. Word has length 31 [2019-12-07 15:48:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:23,339 INFO L462 AbstractCegarLoop]: Abstraction has 44036 states and 61442 transitions. [2019-12-07 15:48:23,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 44036 states and 61442 transitions. [2019-12-07 15:48:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:48:23,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:23,358 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-12-07 15:48:23,358 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1431606241, now seen corresponding path program 1 times [2019-12-07 15:48:23,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:23,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859788254] [2019-12-07 15:48:23,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859788254] [2019-12-07 15:48:23,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:23,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:23,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184148786] [2019-12-07 15:48:23,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:23,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:23,376 INFO L87 Difference]: Start difference. First operand 44036 states and 61442 transitions. Second operand 3 states. [2019-12-07 15:48:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:23,780 INFO L93 Difference]: Finished difference Result 129032 states and 178180 transitions. [2019-12-07 15:48:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:23,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 15:48:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:23,859 INFO L225 Difference]: With dead ends: 129032 [2019-12-07 15:48:23,860 INFO L226 Difference]: Without dead ends: 86022 [2019-12-07 15:48:23,883 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-12-07 15:48:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86022 states. [2019-12-07 15:48:24,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86022 to 86020. [2019-12-07 15:48:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86020 states. [2019-12-07 15:48:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 116738 transitions. [2019-12-07 15:48:24,940 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 116738 transitions. Word has length 31 [2019-12-07 15:48:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:24,940 INFO L462 AbstractCegarLoop]: Abstraction has 86020 states and 116738 transitions. [2019-12-07 15:48:24,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 116738 transitions. [2019-12-07 15:48:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 15:48:24,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:24,971 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-12-07 15:48:24,971 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -869216349, now seen corresponding path program 1 times [2019-12-07 15:48:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746621633] [2019-12-07 15:48:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:24,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746621633] [2019-12-07 15:48:24,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:24,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:24,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358060703] [2019-12-07 15:48:24,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:24,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:24,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:24,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:24,986 INFO L87 Difference]: Start difference. First operand 86020 states and 116738 transitions. Second operand 3 states. [2019-12-07 15:48:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:25,566 INFO L93 Difference]: Finished difference Result 96264 states and 135172 transitions. [2019-12-07 15:48:25,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:25,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 15:48:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:25,635 INFO L225 Difference]: With dead ends: 96264 [2019-12-07 15:48:25,636 INFO L226 Difference]: Without dead ends: 96262 [2019-12-07 15:48:25,646 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-12-07 15:48:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96262 states. [2019-12-07 15:48:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96262 to 86020. [2019-12-07 15:48:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86020 states. [2019-12-07 15:48:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86020 states to 86020 states and 115714 transitions. [2019-12-07 15:48:26,616 INFO L78 Accepts]: Start accepts. Automaton has 86020 states and 115714 transitions. Word has length 31 [2019-12-07 15:48:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:26,616 INFO L462 AbstractCegarLoop]: Abstraction has 86020 states and 115714 transitions. [2019-12-07 15:48:26,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 86020 states and 115714 transitions. [2019-12-07 15:48:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 15:48:26,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:26,657 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] [2019-12-07 15:48:26,657 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1430335648, now seen corresponding path program 1 times [2019-12-07 15:48:26,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:26,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11765515] [2019-12-07 15:48:26,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:26,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11765515] [2019-12-07 15:48:26,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:26,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:26,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046277741] [2019-12-07 15:48:26,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:26,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:26,676 INFO L87 Difference]: Start difference. First operand 86020 states and 115714 transitions. Second operand 3 states. [2019-12-07 15:48:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:27,445 INFO L93 Difference]: Finished difference Result 146440 states and 200708 transitions. [2019-12-07 15:48:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:27,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 15:48:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:27,569 INFO L225 Difference]: With dead ends: 146440 [2019-12-07 15:48:27,569 INFO L226 Difference]: Without dead ends: 146438 [2019-12-07 15:48:27,590 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-12-07 15:48:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146438 states. [2019-12-07 15:48:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146438 to 130052. [2019-12-07 15:48:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130052 states. [2019-12-07 15:48:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130052 states to 130052 states and 169986 transitions. [2019-12-07 15:48:29,707 INFO L78 Accepts]: Start accepts. Automaton has 130052 states and 169986 transitions. Word has length 32 [2019-12-07 15:48:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:29,707 INFO L462 AbstractCegarLoop]: Abstraction has 130052 states and 169986 transitions. [2019-12-07 15:48:29,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 130052 states and 169986 transitions. [2019-12-07 15:48:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 15:48:29,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:29,772 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] [2019-12-07 15:48:29,772 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash -563809058, now seen corresponding path program 1 times [2019-12-07 15:48:29,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:29,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747768019] [2019-12-07 15:48:29,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:29,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747768019] [2019-12-07 15:48:29,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:29,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:29,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145966309] [2019-12-07 15:48:29,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:29,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:29,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:29,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:29,788 INFO L87 Difference]: Start difference. First operand 130052 states and 169986 transitions. Second operand 3 states. [2019-12-07 15:48:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:30,773 INFO L93 Difference]: Finished difference Result 297992 states and 391172 transitions. [2019-12-07 15:48:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:30,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 15:48:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:30,921 INFO L225 Difference]: With dead ends: 297992 [2019-12-07 15:48:30,921 INFO L226 Difference]: Without dead ends: 168966 [2019-12-07 15:48:30,977 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-12-07 15:48:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168966 states. [2019-12-07 15:48:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168966 to 168964. [2019-12-07 15:48:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168964 states. [2019-12-07 15:48:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168964 states to 168964 states and 219138 transitions. [2019-12-07 15:48:33,136 INFO L78 Accepts]: Start accepts. Automaton has 168964 states and 219138 transitions. Word has length 32 [2019-12-07 15:48:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:33,136 INFO L462 AbstractCegarLoop]: Abstraction has 168964 states and 219138 transitions. [2019-12-07 15:48:33,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 168964 states and 219138 transitions. [2019-12-07 15:48:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:48:33,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:33,207 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] [2019-12-07 15:48:33,207 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1390947606, now seen corresponding path program 1 times [2019-12-07 15:48:33,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:33,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443528677] [2019-12-07 15:48:33,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:33,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443528677] [2019-12-07 15:48:33,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:33,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:33,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806256641] [2019-12-07 15:48:33,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:33,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:33,220 INFO L87 Difference]: Start difference. First operand 168964 states and 219138 transitions. Second operand 3 states. [2019-12-07 15:48:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:34,309 INFO L93 Difference]: Finished difference Result 254984 states and 330756 transitions. [2019-12-07 15:48:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:34,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 15:48:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:34,449 INFO L225 Difference]: With dead ends: 254984 [2019-12-07 15:48:34,450 INFO L226 Difference]: Without dead ends: 172038 [2019-12-07 15:48:34,487 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-12-07 15:48:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172038 states. [2019-12-07 15:48:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172038 to 172036. [2019-12-07 15:48:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172036 states. [2019-12-07 15:48:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172036 states to 172036 states and 221186 transitions. [2019-12-07 15:48:36,528 INFO L78 Accepts]: Start accepts. Automaton has 172036 states and 221186 transitions. Word has length 33 [2019-12-07 15:48:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:36,529 INFO L462 AbstractCegarLoop]: Abstraction has 172036 states and 221186 transitions. [2019-12-07 15:48:36,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 172036 states and 221186 transitions. [2019-12-07 15:48:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:48:36,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:36,620 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] [2019-12-07 15:48:36,620 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:36,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -297996136, now seen corresponding path program 1 times [2019-12-07 15:48:36,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:36,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734371525] [2019-12-07 15:48:36,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:36,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734371525] [2019-12-07 15:48:36,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:36,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:36,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170760246] [2019-12-07 15:48:36,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:36,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:36,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:36,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:36,635 INFO L87 Difference]: Start difference. First operand 172036 states and 221186 transitions. Second operand 3 states. [2019-12-07 15:48:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:38,056 INFO L93 Difference]: Finished difference Result 286728 states and 372740 transitions. [2019-12-07 15:48:38,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:38,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 15:48:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:38,342 INFO L225 Difference]: With dead ends: 286728 [2019-12-07 15:48:38,342 INFO L226 Difference]: Without dead ends: 286726 [2019-12-07 15:48:38,393 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-12-07 15:48:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286726 states. [2019-12-07 15:48:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286726 to 262148. [2019-12-07 15:48:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262148 states. [2019-12-07 15:48:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262148 states to 262148 states and 327682 transitions. [2019-12-07 15:48:41,223 INFO L78 Accepts]: Start accepts. Automaton has 262148 states and 327682 transitions. Word has length 33 [2019-12-07 15:48:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:41,224 INFO L462 AbstractCegarLoop]: Abstraction has 262148 states and 327682 transitions. [2019-12-07 15:48:41,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 262148 states and 327682 transitions. [2019-12-07 15:48:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:48:41,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:41,369 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] [2019-12-07 15:48:41,370 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2002826454, now seen corresponding path program 1 times [2019-12-07 15:48:41,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:41,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343886466] [2019-12-07 15:48:41,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:41,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343886466] [2019-12-07 15:48:41,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:41,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:41,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853116532] [2019-12-07 15:48:41,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:41,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:41,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:41,382 INFO L87 Difference]: Start difference. First operand 262148 states and 327682 transitions. Second operand 3 states. [2019-12-07 15:48:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:43,446 INFO L93 Difference]: Finished difference Result 593928 states and 741380 transitions. [2019-12-07 15:48:43,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:43,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 15:48:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:45,616 INFO L225 Difference]: With dead ends: 593928 [2019-12-07 15:48:45,616 INFO L226 Difference]: Without dead ends: 335878 [2019-12-07 15:48:45,683 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-12-07 15:48:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335878 states. [2019-12-07 15:48:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335878 to 335876. [2019-12-07 15:48:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335876 states. [2019-12-07 15:48:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335876 states to 335876 states and 413698 transitions. [2019-12-07 15:48:49,689 INFO L78 Accepts]: Start accepts. Automaton has 335876 states and 413698 transitions. Word has length 33 [2019-12-07 15:48:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:49,689 INFO L462 AbstractCegarLoop]: Abstraction has 335876 states and 413698 transitions. [2019-12-07 15:48:49,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 335876 states and 413698 transitions. [2019-12-07 15:48:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:48:49,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:49,836 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] [2019-12-07 15:48:49,836 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash -647729805, now seen corresponding path program 1 times [2019-12-07 15:48:49,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:49,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996784969] [2019-12-07 15:48:49,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:49,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996784969] [2019-12-07 15:48:49,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:49,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:49,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458637458] [2019-12-07 15:48:49,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:49,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:49,851 INFO L87 Difference]: Start difference. First operand 335876 states and 413698 transitions. Second operand 3 states. [2019-12-07 15:48:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:51,731 INFO L93 Difference]: Finished difference Result 503816 states and 618500 transitions. [2019-12-07 15:48:51,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:48:51,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 15:48:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:52,090 INFO L225 Difference]: With dead ends: 503816 [2019-12-07 15:48:52,090 INFO L226 Difference]: Without dead ends: 339974 [2019-12-07 15:48:52,192 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-12-07 15:48:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339974 states. [2019-12-07 15:48:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339974 to 339972. [2019-12-07 15:48:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339972 states. [2019-12-07 15:48:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339972 states to 339972 states and 413698 transitions. [2019-12-07 15:48:56,834 INFO L78 Accepts]: Start accepts. Automaton has 339972 states and 413698 transitions. Word has length 34 [2019-12-07 15:48:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:56,834 INFO L462 AbstractCegarLoop]: Abstraction has 339972 states and 413698 transitions. [2019-12-07 15:48:56,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:48:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 339972 states and 413698 transitions. [2019-12-07 15:48:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:48:56,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:56,988 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] [2019-12-07 15:48:56,988 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:56,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1958293749, now seen corresponding path program 1 times [2019-12-07 15:48:56,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:48:56,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374134171] [2019-12-07 15:48:56,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:57,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374134171] [2019-12-07 15:48:57,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:57,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:48:57,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599377833] [2019-12-07 15:48:57,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:48:57,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:48:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:48:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:48:57,002 INFO L87 Difference]: Start difference. First operand 339972 states and 413698 transitions. Second operand 3 states. [2019-12-07 15:49:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:01,626 INFO L93 Difference]: Finished difference Result 557064 states and 679940 transitions. [2019-12-07 15:49:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:01,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 15:49:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:02,204 INFO L225 Difference]: With dead ends: 557064 [2019-12-07 15:49:02,205 INFO L226 Difference]: Without dead ends: 557062 [2019-12-07 15:49:02,267 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-12-07 15:49:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557062 states. [2019-12-07 15:49:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557062 to 524292. [2019-12-07 15:49:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524292 states. [2019-12-07 15:49:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524292 states to 524292 states and 622594 transitions. [2019-12-07 15:49:07,806 INFO L78 Accepts]: Start accepts. Automaton has 524292 states and 622594 transitions. Word has length 34 [2019-12-07 15:49:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:07,806 INFO L462 AbstractCegarLoop]: Abstraction has 524292 states and 622594 transitions. [2019-12-07 15:49:07,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:49:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 524292 states and 622594 transitions. [2019-12-07 15:49:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:49:08,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:08,125 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] [2019-12-07 15:49:08,125 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:08,126 INFO L82 PathProgramCache]: Analyzing trace with hash -35850957, now seen corresponding path program 1 times [2019-12-07 15:49:08,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:08,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89419157] [2019-12-07 15:49:08,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:08,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89419157] [2019-12-07 15:49:08,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:08,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:08,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271107810] [2019-12-07 15:49:08,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:49:08,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:49:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:49:08,139 INFO L87 Difference]: Start difference. First operand 524292 states and 622594 transitions. Second operand 3 states. [2019-12-07 15:49:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:12,806 INFO L93 Difference]: Finished difference Result 1179656 states and 1392644 transitions. [2019-12-07 15:49:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:12,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 15:49:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:13,456 INFO L225 Difference]: With dead ends: 1179656 [2019-12-07 15:49:13,456 INFO L226 Difference]: Without dead ends: 663558 [2019-12-07 15:49:13,631 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-12-07 15:49:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663558 states. [2019-12-07 15:49:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663558 to 663556. [2019-12-07 15:49:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663556 states. [2019-12-07 15:49:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663556 states to 663556 states and 770050 transitions. [2019-12-07 15:49:25,175 INFO L78 Accepts]: Start accepts. Automaton has 663556 states and 770050 transitions. Word has length 34 [2019-12-07 15:49:25,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:25,175 INFO L462 AbstractCegarLoop]: Abstraction has 663556 states and 770050 transitions. [2019-12-07 15:49:25,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:49:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 663556 states and 770050 transitions. [2019-12-07 15:49:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:49:25,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:25,511 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] [2019-12-07 15:49:25,511 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 577780235, now seen corresponding path program 1 times [2019-12-07 15:49:25,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:25,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788008651] [2019-12-07 15:49:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:25,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788008651] [2019-12-07 15:49:25,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:25,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:25,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659025808] [2019-12-07 15:49:25,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:49:25,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:49:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:49:25,800 INFO L87 Difference]: Start difference. First operand 663556 states and 770050 transitions. Second operand 3 states. [2019-12-07 15:49:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:30,047 INFO L93 Difference]: Finished difference Result 995336 states and 1150980 transitions. [2019-12-07 15:49:30,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:30,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 15:49:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:30,776 INFO L225 Difference]: With dead ends: 995336 [2019-12-07 15:49:30,776 INFO L226 Difference]: Without dead ends: 671750 [2019-12-07 15:49:30,925 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-12-07 15:49:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671750 states. [2019-12-07 15:49:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671750 to 671748. [2019-12-07 15:49:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671748 states. [2019-12-07 15:49:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671748 states to 671748 states and 770050 transitions. [2019-12-07 15:49:43,580 INFO L78 Accepts]: Start accepts. Automaton has 671748 states and 770050 transitions. Word has length 35 [2019-12-07 15:49:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:43,580 INFO L462 AbstractCegarLoop]: Abstraction has 671748 states and 770050 transitions. [2019-12-07 15:49:43,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:49:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 671748 states and 770050 transitions. [2019-12-07 15:49:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:49:43,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:43,908 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] [2019-12-07 15:49:43,909 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1111163507, now seen corresponding path program 1 times [2019-12-07 15:49:43,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:49:43,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276934864] [2019-12-07 15:49:43,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:49:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:43,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276934864] [2019-12-07 15:49:43,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:43,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:49:43,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514965941] [2019-12-07 15:49:43,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:49:43,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:49:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:49:43,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:49:43,921 INFO L87 Difference]: Start difference. First operand 671748 states and 770050 transitions. Second operand 3 states. [2019-12-07 15:49:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:50,331 INFO L93 Difference]: Finished difference Result 1081350 states and 1228803 transitions. [2019-12-07 15:49:50,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:49:50,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 15:49:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:51,815 INFO L225 Difference]: With dead ends: 1081350 [2019-12-07 15:49:51,816 INFO L226 Difference]: Without dead ends: 1081348 [2019-12-07 15:49:51,900 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-12-07 15:49:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081348 states. [2019-12-07 15:50:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081348 to 1048580. [2019-12-07 15:50:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048580 states. [2019-12-07 15:50:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048580 states to 1048580 states and 1179650 transitions. [2019-12-07 15:50:03,741 INFO L78 Accepts]: Start accepts. Automaton has 1048580 states and 1179650 transitions. Word has length 35 [2019-12-07 15:50:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:03,741 INFO L462 AbstractCegarLoop]: Abstraction has 1048580 states and 1179650 transitions. [2019-12-07 15:50:03,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:50:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1048580 states and 1179650 transitions. [2019-12-07 15:50:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 15:50:04,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:04,355 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] [2019-12-07 15:50:04,355 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1189659083, now seen corresponding path program 1 times [2019-12-07 15:50:04,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:50:04,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197703099] [2019-12-07 15:50:04,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:50:04,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197703099] [2019-12-07 15:50:04,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:04,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:50:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333208412] [2019-12-07 15:50:04,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:50:04,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:50:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:50:04,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:50:04,368 INFO L87 Difference]: Start difference. First operand 1048580 states and 1179650 transitions. Second operand 3 states. [2019-12-07 15:50:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:16,013 INFO L93 Difference]: Finished difference Result 2342916 states and 2605058 transitions. [2019-12-07 15:50:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:50:16,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 15:50:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:16,014 INFO L225 Difference]: With dead ends: 2342916 [2019-12-07 15:50:16,014 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:50:16,366 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-12-07 15:50:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:50:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:50:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:50:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:50:16,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-12-07 15:50:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:16,367 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:50:16,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:50:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:50:16,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:50:16,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:50:16,450 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 15:50:16,450 INFO L246 CegarLoopResult]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,450 INFO L246 CegarLoopResult]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L219(line 219) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:50:16,451 INFO L249 CegarLoopResult]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L91(lines 91 93) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L242 CegarLoopResult]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L246 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2019-12-07 15:50:16,452 INFO L249 CegarLoopResult]: At program point L229(lines 5 233) the Hoare annotation is: true [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L214(line 214) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L249 CegarLoopResult]: At program point L232(lines 4 233) the Hoare annotation is: true [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 15:50:16,453 INFO L246 CegarLoopResult]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2019-12-07 15:50:16,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:50:16 BoogieIcfgContainer [2019-12-07 15:50:16,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:50:16,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:50:16,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:50:16,461 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:50:16,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:17" (3/4) ... [2019-12-07 15:50:16,463 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:50:16,472 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 15:50:16,472 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:50:16,511 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_163304e5-a0c1-4ead-af20-8899e39ba768/bin/uautomizer/witness.graphml [2019-12-07 15:50:16,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:50:16,513 INFO L168 Benchmark]: Toolchain (without parser) took 119669.57 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 946.3 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 15:50:16,513 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:50:16,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:16,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:50:16,514 INFO L168 Benchmark]: Boogie Preprocessor took 17.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:16,514 INFO L168 Benchmark]: RCFGBuilder took 245.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:16,514 INFO L168 Benchmark]: TraceAbstraction took 119098.22 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 15:50:16,514 INFO L168 Benchmark]: Witness Printer took 50.88 ms. Allocated memory is still 7.8 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:16,515 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 228.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -148.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119098.22 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 50.88 ms. Allocated memory is still 7.8 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Result: SAFE, OverallTime: 118.9s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 50.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5037 SDtfs, 2595 SDslu, 3413 SDs, 0 SdLazy, 223 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048580occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 64.4s AutomataMinimizationTime, 42 MinimizatonAttempts, 131118 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 32777 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1183 NumberOfCodeBlocks, 1183 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 71760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 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 correct! Received shutdown request...