./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version b2eff8ba
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f62de5d75db0b2d49331dba44cec50cdc6b7f3c7cb3085015df6ef978c04ff42
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-b2eff8b
[2021-10-28 23:51:09,015 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-28 23:51:09,018 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-28 23:51:09,062 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-28 23:51:09,063 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-28 23:51:09,064 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-28 23:51:09,067 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-28 23:51:09,070 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-28 23:51:09,074 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-28 23:51:09,076 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-28 23:51:09,078 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-28 23:51:09,080 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-28 23:51:09,087 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-28 23:51:09,092 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-28 23:51:09,095 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-28 23:51:09,098 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-28 23:51:09,100 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-28 23:51:09,112 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-28 23:51:09,116 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-28 23:51:09,120 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-28 23:51:09,127 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-28 23:51:09,131 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-28 23:51:09,134 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-28 23:51:09,136 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-28 23:51:09,142 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-28 23:51:09,151 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-28 23:51:09,151 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-28 23:51:09,153 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-28 23:51:09,155 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-28 23:51:09,157 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-28 23:51:09,159 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-28 23:51:09,161 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-28 23:51:09,164 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-28 23:51:09,165 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-28 23:51:09,168 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-28 23:51:09,168 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-28 23:51:09,169 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-28 23:51:09,170 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-28 23:51:09,170 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-28 23:51:09,172 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-28 23:51:09,173 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-28 23:51:09,176 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-28 23:51:09,211 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-28 23:51:09,211 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-28 23:51:09,212 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-28 23:51:09,212 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-28 23:51:09,214 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-28 23:51:09,214 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-28 23:51:09,215 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-28 23:51:09,215 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-28 23:51:09,215 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-28 23:51:09,216 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-28 23:51:09,216 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-28 23:51:09,216 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-28 23:51:09,217 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-10-28 23:51:09,217 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-28 23:51:09,217 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-10-28 23:51:09,218 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-28 23:51:09,218 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-28 23:51:09,218 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-28 23:51:09,218 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-10-28 23:51:09,219 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-28 23:51:09,219 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-28 23:51:09,219 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-10-28 23:51:09,220 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-28 23:51:09,220 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-28 23:51:09,220 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-10-28 23:51:09,221 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-28 23:51:09,221 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-28 23:51:09,221 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-28 23:51:09,222 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-10-28 23:51:09,222 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-10-28 23:51:09,222 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-28 23:51:09,223 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-28 23:51:09,223 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD
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(reach_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 -> f62de5d75db0b2d49331dba44cec50cdc6b7f3c7cb3085015df6ef978c04ff42
[2021-10-28 23:51:09,591 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-28 23:51:09,631 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-28 23:51:09,635 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-28 23:51:09,636 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-28 23:51:09,638 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-28 23:51:09,639 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c
[2021-10-28 23:51:09,740 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/data/a15cc9f07/4e9e17052e0246d091172a745308af7a/FLAGcb746773f
[2021-10-28 23:51:10,399 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-28 23:51:10,415 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c
[2021-10-28 23:51:10,446 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/data/a15cc9f07/4e9e17052e0246d091172a745308af7a/FLAGcb746773f
[2021-10-28 23:51:10,653 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/data/a15cc9f07/4e9e17052e0246d091172a745308af7a
[2021-10-28 23:51:10,656 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-28 23:51:10,658 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-28 23:51:10,662 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-28 23:51:10,662 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-28 23:51:10,667 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-28 23:51:10,668 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:51:10" (1/1) ...
[2021-10-28 23:51:10,670 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb5ffbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:10, skipping insertion in model container
[2021-10-28 23:51:10,670 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:51:10" (1/1) ...
[2021-10-28 23:51:10,681 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-28 23:51:10,736 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-28 23:51:11,100 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c[49672,49685]
[2021-10-28 23:51:11,110 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:51:11,122 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-28 23:51:11,289 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c[49672,49685]
[2021-10-28 23:51:11,296 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-28 23:51:11,322 INFO  L208         MainTranslator]: Completed translation
[2021-10-28 23:51:11,322 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11 WrapperNode
[2021-10-28 23:51:11,323 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-28 23:51:11,324 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-28 23:51:11,324 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-28 23:51:11,324 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-28 23:51:11,344 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,359 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,422 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-28 23:51:11,424 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-28 23:51:11,424 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-28 23:51:11,424 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-28 23:51:11,436 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,436 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,443 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,447 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,460 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,472 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,477 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,484 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-28 23:51:11,485 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-28 23:51:11,485 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-28 23:51:11,485 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-28 23:51:11,487 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (1/1) ...
[2021-10-28 23:51:11,510 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-28 23:51:11,523 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/z3
[2021-10-28 23:51:11,566 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-10-28 23:51:11,585 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-10-28 23:51:11,631 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-28 23:51:11,632 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-28 23:51:11,632 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-28 23:51:11,632 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-28 23:51:11,834 WARN  L805   $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2021-10-28 23:51:12,682 INFO  L758   $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false;
[2021-10-28 23:51:12,682 INFO  L758   $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false;
[2021-10-28 23:51:12,695 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-28 23:51:12,696 INFO  L299             CfgBuilder]: Removed 7 assume(true) statements.
[2021-10-28 23:51:12,699 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:51:12 BoogieIcfgContainer
[2021-10-28 23:51:12,699 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-28 23:51:12,702 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-28 23:51:12,702 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-10-28 23:51:12,707 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-10-28 23:51:12,708 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:51:10" (1/3) ...
[2021-10-28 23:51:12,709 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f6cbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:51:12, skipping insertion in model container
[2021-10-28 23:51:12,709 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:51:11" (2/3) ...
[2021-10-28 23:51:12,710 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f6cbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:51:12, skipping insertion in model container
[2021-10-28 23:51:12,710 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:51:12" (3/3) ...
[2021-10-28 23:51:12,712 INFO  L111   eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c
[2021-10-28 23:51:12,719 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-28 23:51:12,720 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2021-10-28 23:51:12,786 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-10-28 23:51:12,794 INFO  L339      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2021-10-28 23:51:12,827 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-10-28 23:51:12,855 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 167 states, 165 states have (on average 1.7636363636363637) internal successors, (291), 166 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:12,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2021-10-28 23:51:12,865 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:12,866 INFO  L513         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]
[2021-10-28 23:51:12,867 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:12,896 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:12,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -1659372905, now seen corresponding path program 1 times
[2021-10-28 23:51:12,909 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:12,910 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617169739]
[2021-10-28 23:51:12,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:12,911 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:13,072 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:13,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:13,211 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:13,211 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617169739]
[2021-10-28 23:51:13,212 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617169739] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:13,213 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:13,213 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:13,224 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166076378]
[2021-10-28 23:51:13,238 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:13,242 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:13,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:13,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:13,273 INFO  L87              Difference]: Start difference. First operand  has 167 states, 165 states have (on average 1.7636363636363637) internal successors, (291), 166 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:13,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:13,645 INFO  L93              Difference]: Finished difference Result 353 states and 613 transitions.
[2021-10-28 23:51:13,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:13,647 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28
[2021-10-28 23:51:13,648 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:13,664 INFO  L225             Difference]: With dead ends: 353
[2021-10-28 23:51:13,664 INFO  L226             Difference]: Without dead ends: 174
[2021-10-28 23:51:13,669 INFO  L786         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
[2021-10-28 23:51:13,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2021-10-28 23:51:13,750 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172.
[2021-10-28 23:51:13,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 171 states have (on average 1.6198830409356726) internal successors, (277), 171 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:13,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 277 transitions.
[2021-10-28 23:51:13,758 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 277 transitions. Word has length 28
[2021-10-28 23:51:13,758 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:13,759 INFO  L470      AbstractCegarLoop]: Abstraction has 172 states and 277 transitions.
[2021-10-28 23:51:13,759 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:13,759 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 277 transitions.
[2021-10-28 23:51:13,762 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2021-10-28 23:51:13,762 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:13,763 INFO  L513         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]
[2021-10-28 23:51:13,763 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-28 23:51:13,763 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:13,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:13,765 INFO  L85        PathProgramCache]: Analyzing trace with hash 1067837001, now seen corresponding path program 1 times
[2021-10-28 23:51:13,765 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:13,765 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773833761]
[2021-10-28 23:51:13,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:13,766 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:13,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:13,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:13,879 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:13,879 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773833761]
[2021-10-28 23:51:13,879 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773833761] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:13,880 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:13,880 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:13,880 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456287877]
[2021-10-28 23:51:13,882 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:13,882 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:13,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:13,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:13,884 INFO  L87              Difference]: Start difference. First operand 172 states and 277 transitions. Second operand  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:14,041 INFO  L93              Difference]: Finished difference Result 358 states and 575 transitions.
[2021-10-28 23:51:14,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:14,042 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29
[2021-10-28 23:51:14,042 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:14,045 INFO  L225             Difference]: With dead ends: 358
[2021-10-28 23:51:14,045 INFO  L226             Difference]: Without dead ends: 194
[2021-10-28 23:51:14,047 INFO  L786         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
[2021-10-28 23:51:14,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2021-10-28 23:51:14,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194.
[2021-10-28 23:51:14,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 194 states, 193 states have (on average 1.5906735751295338) internal successors, (307), 193 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 307 transitions.
[2021-10-28 23:51:14,068 INFO  L78                 Accepts]: Start accepts. Automaton has 194 states and 307 transitions. Word has length 29
[2021-10-28 23:51:14,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:14,069 INFO  L470      AbstractCegarLoop]: Abstraction has 194 states and 307 transitions.
[2021-10-28 23:51:14,073 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,074 INFO  L276                IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions.
[2021-10-28 23:51:14,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2021-10-28 23:51:14,075 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:14,076 INFO  L513         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]
[2021-10-28 23:51:14,076 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-28 23:51:14,076 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:14,077 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:14,077 INFO  L85        PathProgramCache]: Analyzing trace with hash -1369735938, now seen corresponding path program 1 times
[2021-10-28 23:51:14,077 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:14,078 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976894010]
[2021-10-28 23:51:14,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:14,078 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:14,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:14,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:14,221 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:14,223 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976894010]
[2021-10-28 23:51:14,224 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976894010] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:14,224 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:14,224 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:14,224 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177819402]
[2021-10-28 23:51:14,225 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:14,225 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:14,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:14,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:14,227 INFO  L87              Difference]: Start difference. First operand 194 states and 307 transitions. Second operand  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:14,421 INFO  L93              Difference]: Finished difference Result 388 states and 616 transitions.
[2021-10-28 23:51:14,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:14,422 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29
[2021-10-28 23:51:14,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:14,427 INFO  L225             Difference]: With dead ends: 388
[2021-10-28 23:51:14,427 INFO  L226             Difference]: Without dead ends: 202
[2021-10-28 23:51:14,434 INFO  L786         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
[2021-10-28 23:51:14,436 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2021-10-28 23:51:14,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200.
[2021-10-28 23:51:14,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 199 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions.
[2021-10-28 23:51:14,476 INFO  L78                 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 29
[2021-10-28 23:51:14,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:14,476 INFO  L470      AbstractCegarLoop]: Abstraction has 200 states and 318 transitions.
[2021-10-28 23:51:14,476 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,477 INFO  L276                IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions.
[2021-10-28 23:51:14,478 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2021-10-28 23:51:14,478 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:14,479 INFO  L513         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]
[2021-10-28 23:51:14,479 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-28 23:51:14,479 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:14,480 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:14,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614302654, now seen corresponding path program 1 times
[2021-10-28 23:51:14,480 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:14,481 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648528774]
[2021-10-28 23:51:14,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:14,481 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:14,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:14,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:14,555 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:14,556 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648528774]
[2021-10-28 23:51:14,556 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648528774] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:14,556 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:14,557 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:14,557 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954681078]
[2021-10-28 23:51:14,558 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:14,558 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:14,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:14,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:14,562 INFO  L87              Difference]: Start difference. First operand 200 states and 318 transitions. Second operand  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,736 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:14,748 INFO  L93              Difference]: Finished difference Result 393 states and 626 transitions.
[2021-10-28 23:51:14,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:14,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29
[2021-10-28 23:51:14,750 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:14,751 INFO  L225             Difference]: With dead ends: 393
[2021-10-28 23:51:14,752 INFO  L226             Difference]: Without dead ends: 201
[2021-10-28 23:51:14,754 INFO  L786         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
[2021-10-28 23:51:14,755 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2021-10-28 23:51:14,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201.
[2021-10-28 23:51:14,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 200 states have (on average 1.595) internal successors, (319), 200 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 319 transitions.
[2021-10-28 23:51:14,784 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 319 transitions. Word has length 29
[2021-10-28 23:51:14,784 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:14,785 INFO  L470      AbstractCegarLoop]: Abstraction has 201 states and 319 transitions.
[2021-10-28 23:51:14,785 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:14,785 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 319 transitions.
[2021-10-28 23:51:14,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2021-10-28 23:51:14,792 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:14,792 INFO  L513         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]
[2021-10-28 23:51:14,793 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-28 23:51:14,793 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:14,795 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:14,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -210698213, now seen corresponding path program 1 times
[2021-10-28 23:51:14,796 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:14,797 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502855273]
[2021-10-28 23:51:14,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:14,797 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:14,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:14,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:14,894 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:14,895 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502855273]
[2021-10-28 23:51:14,895 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502855273] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:14,895 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:14,895 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:14,896 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149202189]
[2021-10-28 23:51:14,896 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:14,896 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:14,897 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:14,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:14,898 INFO  L87              Difference]: Start difference. First operand 201 states and 319 transitions. Second operand  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,052 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:15,052 INFO  L93              Difference]: Finished difference Result 404 states and 638 transitions.
[2021-10-28 23:51:15,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:15,053 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30
[2021-10-28 23:51:15,053 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:15,055 INFO  L225             Difference]: With dead ends: 404
[2021-10-28 23:51:15,055 INFO  L226             Difference]: Without dead ends: 211
[2021-10-28 23:51:15,056 INFO  L786         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
[2021-10-28 23:51:15,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2021-10-28 23:51:15,066 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201.
[2021-10-28 23:51:15,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 200 states have (on average 1.585) internal successors, (317), 200 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 317 transitions.
[2021-10-28 23:51:15,070 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 317 transitions. Word has length 30
[2021-10-28 23:51:15,070 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:15,071 INFO  L470      AbstractCegarLoop]: Abstraction has 201 states and 317 transitions.
[2021-10-28 23:51:15,071 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 317 transitions.
[2021-10-28 23:51:15,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2021-10-28 23:51:15,077 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:15,077 INFO  L513         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]
[2021-10-28 23:51:15,077 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-28 23:51:15,077 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:15,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:15,078 INFO  L85        PathProgramCache]: Analyzing trace with hash -852120702, now seen corresponding path program 1 times
[2021-10-28 23:51:15,078 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:15,079 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736010965]
[2021-10-28 23:51:15,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:15,079 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:15,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:15,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:15,175 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:15,175 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736010965]
[2021-10-28 23:51:15,176 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736010965] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:15,176 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:15,176 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:15,176 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610632662]
[2021-10-28 23:51:15,177 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:15,177 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:15,178 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:15,178 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:15,178 INFO  L87              Difference]: Start difference. First operand 201 states and 317 transitions. Second operand  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:15,317 INFO  L93              Difference]: Finished difference Result 404 states and 634 transitions.
[2021-10-28 23:51:15,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:15,318 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31
[2021-10-28 23:51:15,318 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:15,320 INFO  L225             Difference]: With dead ends: 404
[2021-10-28 23:51:15,320 INFO  L226             Difference]: Without dead ends: 211
[2021-10-28 23:51:15,321 INFO  L786         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
[2021-10-28 23:51:15,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2021-10-28 23:51:15,331 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201.
[2021-10-28 23:51:15,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 200 states have (on average 1.575) internal successors, (315), 200 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 315 transitions.
[2021-10-28 23:51:15,334 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 315 transitions. Word has length 31
[2021-10-28 23:51:15,334 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:15,334 INFO  L470      AbstractCegarLoop]: Abstraction has 201 states and 315 transitions.
[2021-10-28 23:51:15,335 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,335 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 315 transitions.
[2021-10-28 23:51:15,335 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2021-10-28 23:51:15,335 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:15,336 INFO  L513         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]
[2021-10-28 23:51:15,336 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-28 23:51:15,336 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:15,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:15,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 1795373184, now seen corresponding path program 1 times
[2021-10-28 23:51:15,337 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:15,337 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395104673]
[2021-10-28 23:51:15,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:15,338 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:15,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:15,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:15,397 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:15,398 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395104673]
[2021-10-28 23:51:15,398 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395104673] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:15,398 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:15,398 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:15,399 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653692037]
[2021-10-28 23:51:15,399 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:15,399 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:15,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:15,400 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:15,400 INFO  L87              Difference]: Start difference. First operand 201 states and 315 transitions. Second operand  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:15,545 INFO  L93              Difference]: Finished difference Result 404 states and 630 transitions.
[2021-10-28 23:51:15,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:15,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32
[2021-10-28 23:51:15,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:15,550 INFO  L225             Difference]: With dead ends: 404
[2021-10-28 23:51:15,550 INFO  L226             Difference]: Without dead ends: 211
[2021-10-28 23:51:15,552 INFO  L786         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
[2021-10-28 23:51:15,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2021-10-28 23:51:15,563 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201.
[2021-10-28 23:51:15,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 200 states have (on average 1.565) internal successors, (313), 200 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions.
[2021-10-28 23:51:15,566 INFO  L78                 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 32
[2021-10-28 23:51:15,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:15,566 INFO  L470      AbstractCegarLoop]: Abstraction has 201 states and 313 transitions.
[2021-10-28 23:51:15,566 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions.
[2021-10-28 23:51:15,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2021-10-28 23:51:15,567 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:15,568 INFO  L513         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]
[2021-10-28 23:51:15,568 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-28 23:51:15,568 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:15,569 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:15,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -1439838815, now seen corresponding path program 1 times
[2021-10-28 23:51:15,569 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:15,569 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728450136]
[2021-10-28 23:51:15,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:15,570 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:15,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:15,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:15,646 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:15,647 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728450136]
[2021-10-28 23:51:15,647 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728450136] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:15,647 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:15,647 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-28 23:51:15,648 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315449238]
[2021-10-28 23:51:15,648 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-10-28 23:51:15,648 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:15,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-28 23:51:15,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-28 23:51:15,649 INFO  L87              Difference]: Start difference. First operand 201 states and 313 transitions. Second operand  has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,934 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:15,934 INFO  L93              Difference]: Finished difference Result 600 states and 930 transitions.
[2021-10-28 23:51:15,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-28 23:51:15,935 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32
[2021-10-28 23:51:15,935 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:15,939 INFO  L225             Difference]: With dead ends: 600
[2021-10-28 23:51:15,939 INFO  L226             Difference]: Without dead ends: 407
[2021-10-28 23:51:15,940 INFO  L786         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-28 23:51:15,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 407 states.
[2021-10-28 23:51:15,969 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383.
[2021-10-28 23:51:15,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 383 states, 382 states have (on average 1.557591623036649) internal successors, (595), 382 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions.
[2021-10-28 23:51:15,984 INFO  L78                 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 32
[2021-10-28 23:51:15,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:15,985 INFO  L470      AbstractCegarLoop]: Abstraction has 383 states and 595 transitions.
[2021-10-28 23:51:15,985 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:15,985 INFO  L276                IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions.
[2021-10-28 23:51:15,987 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2021-10-28 23:51:15,988 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:15,989 INFO  L513         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:15,989 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-28 23:51:15,989 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:15,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:15,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -443745160, now seen corresponding path program 1 times
[2021-10-28 23:51:15,990 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:15,990 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180914683]
[2021-10-28 23:51:15,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:15,991 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:16,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:16,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:16,087 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:16,087 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180914683]
[2021-10-28 23:51:16,087 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180914683] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:16,087 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:16,087 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:16,088 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596822360]
[2021-10-28 23:51:16,088 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:16,088 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:16,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:16,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:16,089 INFO  L87              Difference]: Start difference. First operand 383 states and 595 transitions. Second operand  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,304 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:16,304 INFO  L93              Difference]: Finished difference Result 842 states and 1324 transitions.
[2021-10-28 23:51:16,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:16,306 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44
[2021-10-28 23:51:16,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:16,313 INFO  L225             Difference]: With dead ends: 842
[2021-10-28 23:51:16,313 INFO  L226             Difference]: Without dead ends: 467
[2021-10-28 23:51:16,321 INFO  L786         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
[2021-10-28 23:51:16,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 467 states.
[2021-10-28 23:51:16,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 449.
[2021-10-28 23:51:16,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 449 states, 448 states have (on average 1.5848214285714286) internal successors, (710), 448 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 710 transitions.
[2021-10-28 23:51:16,359 INFO  L78                 Accepts]: Start accepts. Automaton has 449 states and 710 transitions. Word has length 44
[2021-10-28 23:51:16,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:16,363 INFO  L470      AbstractCegarLoop]: Abstraction has 449 states and 710 transitions.
[2021-10-28 23:51:16,363 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,363 INFO  L276                IsEmpty]: Start isEmpty. Operand 449 states and 710 transitions.
[2021-10-28 23:51:16,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2021-10-28 23:51:16,364 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:16,365 INFO  L513         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:16,365 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-28 23:51:16,365 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:16,366 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:16,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 974176282, now seen corresponding path program 1 times
[2021-10-28 23:51:16,366 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:16,368 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152710771]
[2021-10-28 23:51:16,368 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:16,368 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:16,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:16,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:16,445 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:16,445 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152710771]
[2021-10-28 23:51:16,445 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152710771] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:16,445 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:16,445 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:16,446 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827149496]
[2021-10-28 23:51:16,446 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:16,446 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:16,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:16,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:16,448 INFO  L87              Difference]: Start difference. First operand 449 states and 710 transitions. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:16,658 INFO  L93              Difference]: Finished difference Result 931 states and 1482 transitions.
[2021-10-28 23:51:16,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:16,659 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45
[2021-10-28 23:51:16,659 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:16,664 INFO  L225             Difference]: With dead ends: 931
[2021-10-28 23:51:16,664 INFO  L226             Difference]: Without dead ends: 490
[2021-10-28 23:51:16,665 INFO  L786         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
[2021-10-28 23:51:16,666 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 490 states.
[2021-10-28 23:51:16,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472.
[2021-10-28 23:51:16,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 472 states, 471 states have (on average 1.5987261146496816) internal successors, (753), 471 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 753 transitions.
[2021-10-28 23:51:16,697 INFO  L78                 Accepts]: Start accepts. Automaton has 472 states and 753 transitions. Word has length 45
[2021-10-28 23:51:16,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:16,698 INFO  L470      AbstractCegarLoop]: Abstraction has 472 states and 753 transitions.
[2021-10-28 23:51:16,698 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 472 states and 753 transitions.
[2021-10-28 23:51:16,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2021-10-28 23:51:16,700 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:16,700 INFO  L513         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:16,701 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-28 23:51:16,701 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:16,701 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:16,702 INFO  L85        PathProgramCache]: Analyzing trace with hash 1540899075, now seen corresponding path program 1 times
[2021-10-28 23:51:16,702 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:16,705 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630567823]
[2021-10-28 23:51:16,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:16,706 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:16,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:16,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2021-10-28 23:51:16,788 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:16,788 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630567823]
[2021-10-28 23:51:16,789 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630567823] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:16,789 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:16,789 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:16,789 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659594062]
[2021-10-28 23:51:16,790 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:16,790 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:16,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:16,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:16,791 INFO  L87              Difference]: Start difference. First operand 472 states and 753 transitions. Second operand  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:16,995 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:16,995 INFO  L93              Difference]: Finished difference Result 988 states and 1578 transitions.
[2021-10-28 23:51:16,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:16,996 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56
[2021-10-28 23:51:16,996 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:17,001 INFO  L225             Difference]: With dead ends: 988
[2021-10-28 23:51:17,001 INFO  L226             Difference]: Without dead ends: 524
[2021-10-28 23:51:17,003 INFO  L786         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
[2021-10-28 23:51:17,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 524 states.
[2021-10-28 23:51:17,041 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506.
[2021-10-28 23:51:17,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 506 states, 505 states have (on average 1.5920792079207922) internal successors, (804), 505 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 804 transitions.
[2021-10-28 23:51:17,046 INFO  L78                 Accepts]: Start accepts. Automaton has 506 states and 804 transitions. Word has length 56
[2021-10-28 23:51:17,046 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:17,046 INFO  L470      AbstractCegarLoop]: Abstraction has 506 states and 804 transitions.
[2021-10-28 23:51:17,047 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,047 INFO  L276                IsEmpty]: Start isEmpty. Operand 506 states and 804 transitions.
[2021-10-28 23:51:17,048 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2021-10-28 23:51:17,049 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:17,049 INFO  L513         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:17,049 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-28 23:51:17,050 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:17,050 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:17,051 INFO  L85        PathProgramCache]: Analyzing trace with hash -1188180310, now seen corresponding path program 1 times
[2021-10-28 23:51:17,051 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:17,051 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221142944]
[2021-10-28 23:51:17,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:17,052 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:17,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:17,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2021-10-28 23:51:17,105 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:17,105 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221142944]
[2021-10-28 23:51:17,112 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221142944] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:17,112 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:17,113 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:17,113 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809505135]
[2021-10-28 23:51:17,114 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:17,114 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:17,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:17,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:17,115 INFO  L87              Difference]: Start difference. First operand 506 states and 804 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:17,319 INFO  L93              Difference]: Finished difference Result 1022 states and 1626 transitions.
[2021-10-28 23:51:17,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:17,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57
[2021-10-28 23:51:17,321 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:17,326 INFO  L225             Difference]: With dead ends: 1022
[2021-10-28 23:51:17,327 INFO  L226             Difference]: Without dead ends: 524
[2021-10-28 23:51:17,328 INFO  L786         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
[2021-10-28 23:51:17,329 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 524 states.
[2021-10-28 23:51:17,357 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506.
[2021-10-28 23:51:17,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 506 states, 505 states have (on average 1.5861386138613862) internal successors, (801), 505 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 801 transitions.
[2021-10-28 23:51:17,364 INFO  L78                 Accepts]: Start accepts. Automaton has 506 states and 801 transitions. Word has length 57
[2021-10-28 23:51:17,364 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:17,365 INFO  L470      AbstractCegarLoop]: Abstraction has 506 states and 801 transitions.
[2021-10-28 23:51:17,365 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,365 INFO  L276                IsEmpty]: Start isEmpty. Operand 506 states and 801 transitions.
[2021-10-28 23:51:17,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2021-10-28 23:51:17,367 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:17,367 INFO  L513         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:17,367 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-28 23:51:17,368 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:17,368 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:17,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -2067348000, now seen corresponding path program 1 times
[2021-10-28 23:51:17,369 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:17,369 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979692477]
[2021-10-28 23:51:17,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:17,370 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:17,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:17,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2021-10-28 23:51:17,416 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:17,417 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979692477]
[2021-10-28 23:51:17,417 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979692477] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:17,417 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:17,417 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:17,418 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703695350]
[2021-10-28 23:51:17,418 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:17,418 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:17,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:17,420 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:17,420 INFO  L87              Difference]: Start difference. First operand 506 states and 801 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,642 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:17,642 INFO  L93              Difference]: Finished difference Result 1069 states and 1697 transitions.
[2021-10-28 23:51:17,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:17,643 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57
[2021-10-28 23:51:17,644 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:17,649 INFO  L225             Difference]: With dead ends: 1069
[2021-10-28 23:51:17,649 INFO  L226             Difference]: Without dead ends: 571
[2021-10-28 23:51:17,651 INFO  L786         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
[2021-10-28 23:51:17,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 571 states.
[2021-10-28 23:51:17,683 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569.
[2021-10-28 23:51:17,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 569 states, 568 states have (on average 1.5809859154929577) internal successors, (898), 568 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions.
[2021-10-28 23:51:17,689 INFO  L78                 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 57
[2021-10-28 23:51:17,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:17,691 INFO  L470      AbstractCegarLoop]: Abstraction has 569 states and 898 transitions.
[2021-10-28 23:51:17,691 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions.
[2021-10-28 23:51:17,693 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-10-28 23:51:17,694 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:17,694 INFO  L513         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:17,694 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-10-28 23:51:17,695 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:17,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:17,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -583256949, now seen corresponding path program 1 times
[2021-10-28 23:51:17,696 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:17,696 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484630208]
[2021-10-28 23:51:17,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:17,696 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:17,709 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:17,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:17,757 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:17,758 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484630208]
[2021-10-28 23:51:17,758 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484630208] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:17,758 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:17,759 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:17,759 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732753992]
[2021-10-28 23:51:17,761 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:17,761 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:17,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:17,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:17,762 INFO  L87              Difference]: Start difference. First operand 569 states and 898 transitions. Second operand  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:17,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:17,987 INFO  L93              Difference]: Finished difference Result 1179 states and 1859 transitions.
[2021-10-28 23:51:17,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:17,988 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2021-10-28 23:51:17,989 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:17,994 INFO  L225             Difference]: With dead ends: 1179
[2021-10-28 23:51:17,994 INFO  L226             Difference]: Without dead ends: 618
[2021-10-28 23:51:17,996 INFO  L786         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
[2021-10-28 23:51:17,998 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 618 states.
[2021-10-28 23:51:18,052 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612.
[2021-10-28 23:51:18,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 612 states, 611 states have (on average 1.574468085106383) internal successors, (962), 611 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 962 transitions.
[2021-10-28 23:51:18,059 INFO  L78                 Accepts]: Start accepts. Automaton has 612 states and 962 transitions. Word has length 79
[2021-10-28 23:51:18,060 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:18,060 INFO  L470      AbstractCegarLoop]: Abstraction has 612 states and 962 transitions.
[2021-10-28 23:51:18,060 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,060 INFO  L276                IsEmpty]: Start isEmpty. Operand 612 states and 962 transitions.
[2021-10-28 23:51:18,067 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-10-28 23:51:18,067 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:18,067 INFO  L513         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:18,068 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-28 23:51:18,068 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:18,069 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:18,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357251849, now seen corresponding path program 1 times
[2021-10-28 23:51:18,069 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:18,069 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958625376]
[2021-10-28 23:51:18,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:18,070 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:18,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:18,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 23:51:18,128 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:18,129 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958625376]
[2021-10-28 23:51:18,129 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958625376] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:18,129 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:18,129 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:18,129 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602896179]
[2021-10-28 23:51:18,131 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:18,131 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:18,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:18,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:18,132 INFO  L87              Difference]: Start difference. First operand 612 states and 962 transitions. Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:18,347 INFO  L93              Difference]: Finished difference Result 1222 states and 1920 transitions.
[2021-10-28 23:51:18,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:18,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2021-10-28 23:51:18,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:18,353 INFO  L225             Difference]: With dead ends: 1222
[2021-10-28 23:51:18,354 INFO  L226             Difference]: Without dead ends: 618
[2021-10-28 23:51:18,357 INFO  L786         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
[2021-10-28 23:51:18,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 618 states.
[2021-10-28 23:51:18,392 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612.
[2021-10-28 23:51:18,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 612 states, 611 states have (on average 1.5695581014729951) internal successors, (959), 611 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 959 transitions.
[2021-10-28 23:51:18,399 INFO  L78                 Accepts]: Start accepts. Automaton has 612 states and 959 transitions. Word has length 80
[2021-10-28 23:51:18,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:18,399 INFO  L470      AbstractCegarLoop]: Abstraction has 612 states and 959 transitions.
[2021-10-28 23:51:18,399 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 612 states and 959 transitions.
[2021-10-28 23:51:18,402 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-10-28 23:51:18,402 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:18,403 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:18,403 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-10-28 23:51:18,403 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:18,404 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:18,404 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054627548, now seen corresponding path program 1 times
[2021-10-28 23:51:18,404 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:18,407 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418984349]
[2021-10-28 23:51:18,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:18,408 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:18,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:18,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2021-10-28 23:51:18,451 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:18,452 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418984349]
[2021-10-28 23:51:18,454 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418984349] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:18,455 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:18,455 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:18,455 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155961822]
[2021-10-28 23:51:18,456 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:18,456 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:18,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:18,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:18,457 INFO  L87              Difference]: Start difference. First operand 612 states and 959 transitions. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,661 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:18,661 INFO  L93              Difference]: Finished difference Result 1218 states and 1908 transitions.
[2021-10-28 23:51:18,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:18,662 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2021-10-28 23:51:18,662 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:18,667 INFO  L225             Difference]: With dead ends: 1218
[2021-10-28 23:51:18,668 INFO  L226             Difference]: Without dead ends: 614
[2021-10-28 23:51:18,669 INFO  L786         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
[2021-10-28 23:51:18,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 614 states.
[2021-10-28 23:51:18,705 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612.
[2021-10-28 23:51:18,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 612 states, 611 states have (on average 1.5613747954173487) internal successors, (954), 611 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 954 transitions.
[2021-10-28 23:51:18,712 INFO  L78                 Accepts]: Start accepts. Automaton has 612 states and 954 transitions. Word has length 85
[2021-10-28 23:51:18,712 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:18,712 INFO  L470      AbstractCegarLoop]: Abstraction has 612 states and 954 transitions.
[2021-10-28 23:51:18,713 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 612 states and 954 transitions.
[2021-10-28 23:51:18,715 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2021-10-28 23:51:18,715 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:18,716 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:18,716 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-28 23:51:18,716 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:18,717 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:18,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -1047765588, now seen corresponding path program 1 times
[2021-10-28 23:51:18,717 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:18,717 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98545533]
[2021-10-28 23:51:18,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:18,718 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:18,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:18,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2021-10-28 23:51:18,762 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:18,762 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98545533]
[2021-10-28 23:51:18,762 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98545533] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:18,762 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:18,763 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:18,763 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64128619]
[2021-10-28 23:51:18,763 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:18,764 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:18,764 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:18,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:18,765 INFO  L87              Difference]: Start difference. First operand 612 states and 954 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:18,956 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:18,956 INFO  L93              Difference]: Finished difference Result 1276 states and 1991 transitions.
[2021-10-28 23:51:18,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:18,957 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93
[2021-10-28 23:51:18,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:18,963 INFO  L225             Difference]: With dead ends: 1276
[2021-10-28 23:51:18,963 INFO  L226             Difference]: Without dead ends: 672
[2021-10-28 23:51:18,965 INFO  L786         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
[2021-10-28 23:51:18,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2021-10-28 23:51:19,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644.
[2021-10-28 23:51:19,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 644 states, 643 states have (on average 1.5505443234836702) internal successors, (997), 643 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 997 transitions.
[2021-10-28 23:51:19,017 INFO  L78                 Accepts]: Start accepts. Automaton has 644 states and 997 transitions. Word has length 93
[2021-10-28 23:51:19,018 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:19,018 INFO  L470      AbstractCegarLoop]: Abstraction has 644 states and 997 transitions.
[2021-10-28 23:51:19,018 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,018 INFO  L276                IsEmpty]: Start isEmpty. Operand 644 states and 997 transitions.
[2021-10-28 23:51:19,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2021-10-28 23:51:19,021 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:19,021 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:19,021 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-10-28 23:51:19,022 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:19,022 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:19,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -1111400187, now seen corresponding path program 1 times
[2021-10-28 23:51:19,023 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:19,023 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553824737]
[2021-10-28 23:51:19,023 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:19,023 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:19,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:19,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2021-10-28 23:51:19,062 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:19,062 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553824737]
[2021-10-28 23:51:19,062 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553824737] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:19,062 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:19,063 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:19,063 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479081236]
[2021-10-28 23:51:19,063 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:19,063 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:19,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:19,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:19,065 INFO  L87              Difference]: Start difference. First operand 644 states and 997 transitions. Second operand  has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:19,258 INFO  L93              Difference]: Finished difference Result 1308 states and 2028 transitions.
[2021-10-28 23:51:19,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:19,259 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94
[2021-10-28 23:51:19,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:19,264 INFO  L225             Difference]: With dead ends: 1308
[2021-10-28 23:51:19,264 INFO  L226             Difference]: Without dead ends: 672
[2021-10-28 23:51:19,266 INFO  L786         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
[2021-10-28 23:51:19,267 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2021-10-28 23:51:19,301 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644.
[2021-10-28 23:51:19,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 644 states, 643 states have (on average 1.5412130637636081) internal successors, (991), 643 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 991 transitions.
[2021-10-28 23:51:19,307 INFO  L78                 Accepts]: Start accepts. Automaton has 644 states and 991 transitions. Word has length 94
[2021-10-28 23:51:19,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:19,308 INFO  L470      AbstractCegarLoop]: Abstraction has 644 states and 991 transitions.
[2021-10-28 23:51:19,308 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,308 INFO  L276                IsEmpty]: Start isEmpty. Operand 644 states and 991 transitions.
[2021-10-28 23:51:19,310 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2021-10-28 23:51:19,311 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:19,311 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:19,311 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-10-28 23:51:19,312 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:19,312 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:19,312 INFO  L85        PathProgramCache]: Analyzing trace with hash -51700436, now seen corresponding path program 1 times
[2021-10-28 23:51:19,312 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:19,313 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114048914]
[2021-10-28 23:51:19,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:19,313 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:19,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:19,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2021-10-28 23:51:19,351 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:19,351 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114048914]
[2021-10-28 23:51:19,351 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114048914] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:19,351 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:19,351 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:19,352 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812346153]
[2021-10-28 23:51:19,352 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:19,353 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:19,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:19,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:19,354 INFO  L87              Difference]: Start difference. First operand 644 states and 991 transitions. Second operand  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:19,587 INFO  L93              Difference]: Finished difference Result 1344 states and 2068 transitions.
[2021-10-28 23:51:19,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:19,588 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100
[2021-10-28 23:51:19,589 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:19,594 INFO  L225             Difference]: With dead ends: 1344
[2021-10-28 23:51:19,594 INFO  L226             Difference]: Without dead ends: 708
[2021-10-28 23:51:19,596 INFO  L786         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
[2021-10-28 23:51:19,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 708 states.
[2021-10-28 23:51:19,635 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696.
[2021-10-28 23:51:19,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 696 states, 695 states have (on average 1.5352517985611511) internal successors, (1067), 695 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions.
[2021-10-28 23:51:19,642 INFO  L78                 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100
[2021-10-28 23:51:19,642 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:19,642 INFO  L470      AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions.
[2021-10-28 23:51:19,643 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,643 INFO  L276                IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions.
[2021-10-28 23:51:19,645 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2021-10-28 23:51:19,646 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:19,646 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:19,646 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-10-28 23:51:19,647 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:19,647 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:19,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -530812530, now seen corresponding path program 1 times
[2021-10-28 23:51:19,648 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:19,648 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211801042]
[2021-10-28 23:51:19,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:19,648 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:19,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:19,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2021-10-28 23:51:19,700 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:19,700 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211801042]
[2021-10-28 23:51:19,700 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211801042] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:19,700 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:19,700 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:19,701 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207442100]
[2021-10-28 23:51:19,701 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:19,701 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:19,702 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:19,702 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:19,703 INFO  L87              Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:19,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:19,943 INFO  L93              Difference]: Finished difference Result 1401 states and 2150 transitions.
[2021-10-28 23:51:19,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:19,943 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101
[2021-10-28 23:51:19,944 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:19,949 INFO  L225             Difference]: With dead ends: 1401
[2021-10-28 23:51:19,950 INFO  L226             Difference]: Without dead ends: 709
[2021-10-28 23:51:19,952 INFO  L786         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
[2021-10-28 23:51:19,954 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 709 states.
[2021-10-28 23:51:19,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 697.
[2021-10-28 23:51:19,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 697 states, 696 states have (on average 1.5344827586206897) internal successors, (1068), 696 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1068 transitions.
[2021-10-28 23:51:20,002 INFO  L78                 Accepts]: Start accepts. Automaton has 697 states and 1068 transitions. Word has length 101
[2021-10-28 23:51:20,003 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:20,003 INFO  L470      AbstractCegarLoop]: Abstraction has 697 states and 1068 transitions.
[2021-10-28 23:51:20,003 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 697 states and 1068 transitions.
[2021-10-28 23:51:20,006 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2021-10-28 23:51:20,006 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:20,007 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:20,007 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2021-10-28 23:51:20,007 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:20,008 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:20,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 1306174224, now seen corresponding path program 1 times
[2021-10-28 23:51:20,008 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:20,008 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74779566]
[2021-10-28 23:51:20,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:20,009 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:20,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:20,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2021-10-28 23:51:20,060 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:20,061 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74779566]
[2021-10-28 23:51:20,061 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74779566] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:20,061 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:20,061 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:20,062 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960593839]
[2021-10-28 23:51:20,062 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:20,063 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:20,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:20,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:20,065 INFO  L87              Difference]: Start difference. First operand 697 states and 1068 transitions. Second operand  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:20,292 INFO  L93              Difference]: Finished difference Result 1433 states and 2192 transitions.
[2021-10-28 23:51:20,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:20,293 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112
[2021-10-28 23:51:20,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:20,299 INFO  L225             Difference]: With dead ends: 1433
[2021-10-28 23:51:20,299 INFO  L226             Difference]: Without dead ends: 744
[2021-10-28 23:51:20,301 INFO  L786         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
[2021-10-28 23:51:20,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 744 states.
[2021-10-28 23:51:20,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738.
[2021-10-28 23:51:20,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 738 states, 737 states have (on average 1.5237449118046134) internal successors, (1123), 737 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1123 transitions.
[2021-10-28 23:51:20,355 INFO  L78                 Accepts]: Start accepts. Automaton has 738 states and 1123 transitions. Word has length 112
[2021-10-28 23:51:20,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:20,356 INFO  L470      AbstractCegarLoop]: Abstraction has 738 states and 1123 transitions.
[2021-10-28 23:51:20,356 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 738 states and 1123 transitions.
[2021-10-28 23:51:20,358 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2021-10-28 23:51:20,359 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:20,359 INFO  L513         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:20,359 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-10-28 23:51:20,360 INFO  L402      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:20,360 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:20,361 INFO  L85        PathProgramCache]: Analyzing trace with hash -142977294, now seen corresponding path program 1 times
[2021-10-28 23:51:20,361 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:20,361 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847451797]
[2021-10-28 23:51:20,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:20,362 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:20,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:20,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2021-10-28 23:51:20,413 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:20,414 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847451797]
[2021-10-28 23:51:20,414 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847451797] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:20,414 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:20,414 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:20,415 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890921351]
[2021-10-28 23:51:20,415 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:20,415 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:20,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:20,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:20,417 INFO  L87              Difference]: Start difference. First operand 738 states and 1123 transitions. Second operand  has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,671 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:20,673 INFO  L93              Difference]: Finished difference Result 1474 states and 2242 transitions.
[2021-10-28 23:51:20,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:20,674 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113
[2021-10-28 23:51:20,675 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:20,681 INFO  L225             Difference]: With dead ends: 1474
[2021-10-28 23:51:20,682 INFO  L226             Difference]: Without dead ends: 744
[2021-10-28 23:51:20,684 INFO  L786         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
[2021-10-28 23:51:20,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 744 states.
[2021-10-28 23:51:20,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738.
[2021-10-28 23:51:20,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 738 states, 737 states have (on average 1.5169606512890095) internal successors, (1118), 737 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions.
[2021-10-28 23:51:20,742 INFO  L78                 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 113
[2021-10-28 23:51:20,742 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:20,742 INFO  L470      AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions.
[2021-10-28 23:51:20,743 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:20,743 INFO  L276                IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions.
[2021-10-28 23:51:20,745 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2021-10-28 23:51:20,746 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:20,746 INFO  L513         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:20,746 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2021-10-28 23:51:20,747 INFO  L402      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:20,747 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:20,747 INFO  L85        PathProgramCache]: Analyzing trace with hash 1809562376, now seen corresponding path program 1 times
[2021-10-28 23:51:20,748 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:20,748 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842404675]
[2021-10-28 23:51:20,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:20,748 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:20,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:20,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2021-10-28 23:51:20,793 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:20,794 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842404675]
[2021-10-28 23:51:20,794 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842404675] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:20,794 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:20,794 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:20,796 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153724287]
[2021-10-28 23:51:20,797 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:20,797 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:20,799 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:20,799 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:20,800 INFO  L87              Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:21,005 INFO  L93              Difference]: Finished difference Result 1510 states and 2285 transitions.
[2021-10-28 23:51:21,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:21,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115
[2021-10-28 23:51:21,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:21,012 INFO  L225             Difference]: With dead ends: 1510
[2021-10-28 23:51:21,013 INFO  L226             Difference]: Without dead ends: 780
[2021-10-28 23:51:21,014 INFO  L786         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
[2021-10-28 23:51:21,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 780 states.
[2021-10-28 23:51:21,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770.
[2021-10-28 23:51:21,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 770 states, 769 states have (on average 1.5032509752925878) internal successors, (1156), 769 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1156 transitions.
[2021-10-28 23:51:21,072 INFO  L78                 Accepts]: Start accepts. Automaton has 770 states and 1156 transitions. Word has length 115
[2021-10-28 23:51:21,072 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:21,072 INFO  L470      AbstractCegarLoop]: Abstraction has 770 states and 1156 transitions.
[2021-10-28 23:51:21,073 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 770 states and 1156 transitions.
[2021-10-28 23:51:21,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2021-10-28 23:51:21,076 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:21,076 INFO  L513         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:21,076 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2021-10-28 23:51:21,077 INFO  L402      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:21,077 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:21,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 172042817, now seen corresponding path program 1 times
[2021-10-28 23:51:21,078 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:21,078 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335031938]
[2021-10-28 23:51:21,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:21,078 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:21,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:21,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2021-10-28 23:51:21,131 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:21,131 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335031938]
[2021-10-28 23:51:21,131 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335031938] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:21,132 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:21,132 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:21,132 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881957899]
[2021-10-28 23:51:21,133 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:21,133 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:21,133 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:21,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:21,134 INFO  L87              Difference]: Start difference. First operand 770 states and 1156 transitions. Second operand  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,353 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:21,354 INFO  L93              Difference]: Finished difference Result 1542 states and 2314 transitions.
[2021-10-28 23:51:21,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:21,354 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116
[2021-10-28 23:51:21,355 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:21,360 INFO  L225             Difference]: With dead ends: 1542
[2021-10-28 23:51:21,360 INFO  L226             Difference]: Without dead ends: 780
[2021-10-28 23:51:21,362 INFO  L786         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
[2021-10-28 23:51:21,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 780 states.
[2021-10-28 23:51:21,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770.
[2021-10-28 23:51:21,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 770 states, 769 states have (on average 1.4915474642392719) internal successors, (1147), 769 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1147 transitions.
[2021-10-28 23:51:21,413 INFO  L78                 Accepts]: Start accepts. Automaton has 770 states and 1147 transitions. Word has length 116
[2021-10-28 23:51:21,414 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:21,414 INFO  L470      AbstractCegarLoop]: Abstraction has 770 states and 1147 transitions.
[2021-10-28 23:51:21,414 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,414 INFO  L276                IsEmpty]: Start isEmpty. Operand 770 states and 1147 transitions.
[2021-10-28 23:51:21,417 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2021-10-28 23:51:21,417 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:21,418 INFO  L513         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:21,418 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2021-10-28 23:51:21,418 INFO  L402      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:21,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:21,420 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961382768, now seen corresponding path program 1 times
[2021-10-28 23:51:21,421 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:21,421 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265551854]
[2021-10-28 23:51:21,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:21,421 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:21,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:21,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2021-10-28 23:51:21,470 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:21,470 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265551854]
[2021-10-28 23:51:21,470 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265551854] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:21,471 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:21,471 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:21,471 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931611152]
[2021-10-28 23:51:21,472 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:21,472 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:21,472 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:21,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:21,473 INFO  L87              Difference]: Start difference. First operand 770 states and 1147 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,667 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:21,668 INFO  L93              Difference]: Finished difference Result 1568 states and 2335 transitions.
[2021-10-28 23:51:21,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:21,669 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137
[2021-10-28 23:51:21,669 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:21,675 INFO  L225             Difference]: With dead ends: 1568
[2021-10-28 23:51:21,675 INFO  L226             Difference]: Without dead ends: 806
[2021-10-28 23:51:21,677 INFO  L786         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
[2021-10-28 23:51:21,678 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 806 states.
[2021-10-28 23:51:21,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798.
[2021-10-28 23:51:21,736 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 798 states, 797 states have (on average 1.478042659974906) internal successors, (1178), 797 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1178 transitions.
[2021-10-28 23:51:21,740 INFO  L78                 Accepts]: Start accepts. Automaton has 798 states and 1178 transitions. Word has length 137
[2021-10-28 23:51:21,741 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:21,741 INFO  L470      AbstractCegarLoop]: Abstraction has 798 states and 1178 transitions.
[2021-10-28 23:51:21,742 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,742 INFO  L276                IsEmpty]: Start isEmpty. Operand 798 states and 1178 transitions.
[2021-10-28 23:51:21,744 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2021-10-28 23:51:21,745 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:21,745 INFO  L513         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:21,745 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2021-10-28 23:51:21,746 INFO  L402      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:21,746 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:21,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 1483046825, now seen corresponding path program 1 times
[2021-10-28 23:51:21,746 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:21,747 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306702256]
[2021-10-28 23:51:21,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:21,747 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:21,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:21,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2021-10-28 23:51:21,790 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:21,790 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306702256]
[2021-10-28 23:51:21,790 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306702256] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:21,790 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:21,791 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:21,791 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033800530]
[2021-10-28 23:51:21,792 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:21,792 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:21,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:21,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:21,793 INFO  L87              Difference]: Start difference. First operand 798 states and 1178 transitions. Second operand  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:21,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:21,978 INFO  L93              Difference]: Finished difference Result 1596 states and 2356 transitions.
[2021-10-28 23:51:21,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:21,979 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138
[2021-10-28 23:51:21,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:21,985 INFO  L225             Difference]: With dead ends: 1596
[2021-10-28 23:51:21,986 INFO  L226             Difference]: Without dead ends: 806
[2021-10-28 23:51:21,987 INFO  L786         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
[2021-10-28 23:51:21,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 806 states.
[2021-10-28 23:51:22,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798.
[2021-10-28 23:51:22,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 798 states, 797 states have (on average 1.465495608531995) internal successors, (1168), 797 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1168 transitions.
[2021-10-28 23:51:22,071 INFO  L78                 Accepts]: Start accepts. Automaton has 798 states and 1168 transitions. Word has length 138
[2021-10-28 23:51:22,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:22,071 INFO  L470      AbstractCegarLoop]: Abstraction has 798 states and 1168 transitions.
[2021-10-28 23:51:22,071 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,072 INFO  L276                IsEmpty]: Start isEmpty. Operand 798 states and 1168 transitions.
[2021-10-28 23:51:22,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2021-10-28 23:51:22,075 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:22,075 INFO  L513         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:22,076 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2021-10-28 23:51:22,076 INFO  L402      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:22,076 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:22,077 INFO  L85        PathProgramCache]: Analyzing trace with hash -1313212300, now seen corresponding path program 1 times
[2021-10-28 23:51:22,077 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:22,077 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749923294]
[2021-10-28 23:51:22,077 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:22,078 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:22,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:22,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2021-10-28 23:51:22,136 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:22,137 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749923294]
[2021-10-28 23:51:22,140 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749923294] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:22,140 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:22,140 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:22,140 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977652061]
[2021-10-28 23:51:22,141 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:22,141 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:22,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:22,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:22,142 INFO  L87              Difference]: Start difference. First operand 798 states and 1168 transitions. Second operand  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,367 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:22,367 INFO  L93              Difference]: Finished difference Result 1651 states and 2410 transitions.
[2021-10-28 23:51:22,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:22,368 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141
[2021-10-28 23:51:22,368 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:22,375 INFO  L225             Difference]: With dead ends: 1651
[2021-10-28 23:51:22,375 INFO  L226             Difference]: Without dead ends: 861
[2021-10-28 23:51:22,377 INFO  L786         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
[2021-10-28 23:51:22,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 861 states.
[2021-10-28 23:51:22,432 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 847.
[2021-10-28 23:51:22,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 847 states, 846 states have (on average 1.4527186761229314) internal successors, (1229), 846 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1229 transitions.
[2021-10-28 23:51:22,439 INFO  L78                 Accepts]: Start accepts. Automaton has 847 states and 1229 transitions. Word has length 141
[2021-10-28 23:51:22,439 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:22,439 INFO  L470      AbstractCegarLoop]: Abstraction has 847 states and 1229 transitions.
[2021-10-28 23:51:22,440 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,440 INFO  L276                IsEmpty]: Start isEmpty. Operand 847 states and 1229 transitions.
[2021-10-28 23:51:22,443 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2021-10-28 23:51:22,443 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:22,443 INFO  L513         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:22,444 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2021-10-28 23:51:22,444 INFO  L402      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:22,444 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:22,445 INFO  L85        PathProgramCache]: Analyzing trace with hash 75909554, now seen corresponding path program 1 times
[2021-10-28 23:51:22,445 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:22,445 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130454570]
[2021-10-28 23:51:22,445 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:22,446 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:22,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:22,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2021-10-28 23:51:22,512 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:22,512 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130454570]
[2021-10-28 23:51:22,513 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130454570] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:22,513 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:22,513 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:22,513 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087476926]
[2021-10-28 23:51:22,514 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:22,514 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:22,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:22,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:22,515 INFO  L87              Difference]: Start difference. First operand 847 states and 1229 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:22,730 INFO  L93              Difference]: Finished difference Result 1700 states and 2468 transitions.
[2021-10-28 23:51:22,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:22,731 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2021-10-28 23:51:22,733 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:22,739 INFO  L225             Difference]: With dead ends: 1700
[2021-10-28 23:51:22,740 INFO  L226             Difference]: Without dead ends: 845
[2021-10-28 23:51:22,741 INFO  L786         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
[2021-10-28 23:51:22,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 845 states.
[2021-10-28 23:51:22,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 831.
[2021-10-28 23:51:22,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 831 states, 830 states have (on average 1.453012048192771) internal successors, (1206), 830 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1206 transitions.
[2021-10-28 23:51:22,824 INFO  L78                 Accepts]: Start accepts. Automaton has 831 states and 1206 transitions. Word has length 142
[2021-10-28 23:51:22,824 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:22,824 INFO  L470      AbstractCegarLoop]: Abstraction has 831 states and 1206 transitions.
[2021-10-28 23:51:22,825 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:22,825 INFO  L276                IsEmpty]: Start isEmpty. Operand 831 states and 1206 transitions.
[2021-10-28 23:51:22,827 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2021-10-28 23:51:22,827 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:22,828 INFO  L513         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:22,828 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2021-10-28 23:51:22,828 INFO  L402      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:22,829 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:22,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -2072592764, now seen corresponding path program 1 times
[2021-10-28 23:51:22,829 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:22,829 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347100674]
[2021-10-28 23:51:22,829 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:22,830 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:22,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:22,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2021-10-28 23:51:22,871 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:22,871 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347100674]
[2021-10-28 23:51:22,871 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347100674] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:22,871 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:22,871 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:22,872 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956365154]
[2021-10-28 23:51:22,872 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:22,872 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:22,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:22,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:22,874 INFO  L87              Difference]: Start difference. First operand 831 states and 1206 transitions. Second operand  has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,069 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:23,069 INFO  L93              Difference]: Finished difference Result 1666 states and 2418 transitions.
[2021-10-28 23:51:23,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:23,070 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146
[2021-10-28 23:51:23,070 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:23,075 INFO  L225             Difference]: With dead ends: 1666
[2021-10-28 23:51:23,076 INFO  L226             Difference]: Without dead ends: 843
[2021-10-28 23:51:23,079 INFO  L786         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
[2021-10-28 23:51:23,080 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 843 states.
[2021-10-28 23:51:23,134 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 831.
[2021-10-28 23:51:23,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 831 states, 830 states have (on average 1.4445783132530121) internal successors, (1199), 830 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1199 transitions.
[2021-10-28 23:51:23,140 INFO  L78                 Accepts]: Start accepts. Automaton has 831 states and 1199 transitions. Word has length 146
[2021-10-28 23:51:23,140 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:23,141 INFO  L470      AbstractCegarLoop]: Abstraction has 831 states and 1199 transitions.
[2021-10-28 23:51:23,141 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,141 INFO  L276                IsEmpty]: Start isEmpty. Operand 831 states and 1199 transitions.
[2021-10-28 23:51:23,144 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2021-10-28 23:51:23,144 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:23,144 INFO  L513         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:23,145 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2021-10-28 23:51:23,145 INFO  L402      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:23,146 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:23,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 369501830, now seen corresponding path program 1 times
[2021-10-28 23:51:23,146 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:23,147 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569956246]
[2021-10-28 23:51:23,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:23,147 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:23,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:23,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2021-10-28 23:51:23,205 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:23,206 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569956246]
[2021-10-28 23:51:23,206 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569956246] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:23,206 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:23,206 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:23,206 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106666665]
[2021-10-28 23:51:23,207 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:23,207 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:23,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:23,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:23,208 INFO  L87              Difference]: Start difference. First operand 831 states and 1199 transitions. Second operand  has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,416 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:23,416 INFO  L93              Difference]: Finished difference Result 1666 states and 2404 transitions.
[2021-10-28 23:51:23,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:23,417 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147
[2021-10-28 23:51:23,417 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:23,423 INFO  L225             Difference]: With dead ends: 1666
[2021-10-28 23:51:23,424 INFO  L226             Difference]: Without dead ends: 826
[2021-10-28 23:51:23,426 INFO  L786         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
[2021-10-28 23:51:23,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 826 states.
[2021-10-28 23:51:23,481 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 814.
[2021-10-28 23:51:23,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 814 states, 813 states have (on average 1.4391143911439115) internal successors, (1170), 813 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1170 transitions.
[2021-10-28 23:51:23,489 INFO  L78                 Accepts]: Start accepts. Automaton has 814 states and 1170 transitions. Word has length 147
[2021-10-28 23:51:23,490 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:23,490 INFO  L470      AbstractCegarLoop]: Abstraction has 814 states and 1170 transitions.
[2021-10-28 23:51:23,490 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,491 INFO  L276                IsEmpty]: Start isEmpty. Operand 814 states and 1170 transitions.
[2021-10-28 23:51:23,493 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2021-10-28 23:51:23,493 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:23,494 INFO  L513         BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:23,494 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2021-10-28 23:51:23,494 INFO  L402      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:23,495 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:23,495 INFO  L85        PathProgramCache]: Analyzing trace with hash 1770310156, now seen corresponding path program 1 times
[2021-10-28 23:51:23,495 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:23,495 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233939984]
[2021-10-28 23:51:23,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:23,496 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:23,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:23,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked.
[2021-10-28 23:51:23,568 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:23,568 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233939984]
[2021-10-28 23:51:23,568 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233939984] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:23,568 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:23,569 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:23,569 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336304852]
[2021-10-28 23:51:23,569 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:23,569 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:23,570 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:23,570 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:23,570 INFO  L87              Difference]: Start difference. First operand 814 states and 1170 transitions. Second operand  has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:23,677 INFO  L93              Difference]: Finished difference Result 2412 states and 3460 transitions.
[2021-10-28 23:51:23,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:23,678 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154
[2021-10-28 23:51:23,679 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:23,690 INFO  L225             Difference]: With dead ends: 2412
[2021-10-28 23:51:23,690 INFO  L226             Difference]: Without dead ends: 1606
[2021-10-28 23:51:23,692 INFO  L786         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
[2021-10-28 23:51:23,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1606 states.
[2021-10-28 23:51:23,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 816.
[2021-10-28 23:51:23,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 816 states, 815 states have (on average 1.4380368098159508) internal successors, (1172), 815 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1172 transitions.
[2021-10-28 23:51:23,771 INFO  L78                 Accepts]: Start accepts. Automaton has 816 states and 1172 transitions. Word has length 154
[2021-10-28 23:51:23,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:23,771 INFO  L470      AbstractCegarLoop]: Abstraction has 816 states and 1172 transitions.
[2021-10-28 23:51:23,772 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 816 states and 1172 transitions.
[2021-10-28 23:51:23,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2021-10-28 23:51:23,774 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:23,775 INFO  L513         BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:23,775 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2021-10-28 23:51:23,776 INFO  L402      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:23,776 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:23,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1570716982, now seen corresponding path program 1 times
[2021-10-28 23:51:23,776 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:23,777 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965637835]
[2021-10-28 23:51:23,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:23,777 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:23,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:23,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2021-10-28 23:51:23,846 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:23,846 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965637835]
[2021-10-28 23:51:23,846 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965637835] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:23,846 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:23,847 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:23,847 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692353869]
[2021-10-28 23:51:23,847 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:23,848 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:23,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:23,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:23,849 INFO  L87              Difference]: Start difference. First operand 816 states and 1172 transitions. Second operand  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:23,970 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:23,971 INFO  L93              Difference]: Finished difference Result 2411 states and 3456 transitions.
[2021-10-28 23:51:23,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:23,971 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154
[2021-10-28 23:51:23,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:23,984 INFO  L225             Difference]: With dead ends: 2411
[2021-10-28 23:51:23,984 INFO  L226             Difference]: Without dead ends: 1603
[2021-10-28 23:51:23,987 INFO  L786         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
[2021-10-28 23:51:23,990 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1603 states.
[2021-10-28 23:51:24,132 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1601.
[2021-10-28 23:51:24,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1601 states, 1600 states have (on average 1.4325) internal successors, (2292), 1600 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:24,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2292 transitions.
[2021-10-28 23:51:24,166 INFO  L78                 Accepts]: Start accepts. Automaton has 1601 states and 2292 transitions. Word has length 154
[2021-10-28 23:51:24,167 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:24,167 INFO  L470      AbstractCegarLoop]: Abstraction has 1601 states and 2292 transitions.
[2021-10-28 23:51:24,168 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:24,168 INFO  L276                IsEmpty]: Start isEmpty. Operand 1601 states and 2292 transitions.
[2021-10-28 23:51:24,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2021-10-28 23:51:24,171 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:24,172 INFO  L513         BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:24,172 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2021-10-28 23:51:24,172 INFO  L402      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:24,172 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:24,173 INFO  L85        PathProgramCache]: Analyzing trace with hash -362729202, now seen corresponding path program 1 times
[2021-10-28 23:51:24,173 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:24,173 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704238944]
[2021-10-28 23:51:24,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:24,174 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:24,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:24,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked.
[2021-10-28 23:51:24,335 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:24,335 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704238944]
[2021-10-28 23:51:24,335 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704238944] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:24,336 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:24,336 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:24,336 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996804714]
[2021-10-28 23:51:24,336 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:24,337 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:24,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:24,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:24,338 INFO  L87              Difference]: Start difference. First operand 1601 states and 2292 transitions. Second operand  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:24,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:24,585 INFO  L93              Difference]: Finished difference Result 4747 states and 6780 transitions.
[2021-10-28 23:51:24,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:24,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156
[2021-10-28 23:51:24,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:24,610 INFO  L225             Difference]: With dead ends: 4747
[2021-10-28 23:51:24,610 INFO  L226             Difference]: Without dead ends: 3154
[2021-10-28 23:51:24,615 INFO  L786         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
[2021-10-28 23:51:24,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3154 states.
[2021-10-28 23:51:24,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 1601.
[2021-10-28 23:51:24,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1601 states, 1600 states have (on average 1.43) internal successors, (2288), 1600 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:24,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2288 transitions.
[2021-10-28 23:51:24,820 INFO  L78                 Accepts]: Start accepts. Automaton has 1601 states and 2288 transitions. Word has length 156
[2021-10-28 23:51:24,821 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:24,821 INFO  L470      AbstractCegarLoop]: Abstraction has 1601 states and 2288 transitions.
[2021-10-28 23:51:24,821 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:24,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 1601 states and 2288 transitions.
[2021-10-28 23:51:24,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2021-10-28 23:51:24,825 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:24,826 INFO  L513         BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:24,826 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2021-10-28 23:51:24,826 INFO  L402      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:24,827 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:24,827 INFO  L85        PathProgramCache]: Analyzing trace with hash -957693967, now seen corresponding path program 1 times
[2021-10-28 23:51:24,827 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:24,828 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087707061]
[2021-10-28 23:51:24,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:24,828 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:24,845 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 23:51:24,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2021-10-28 23:51:24,883 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 23:51:24,883 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087707061]
[2021-10-28 23:51:24,883 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087707061] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 23:51:24,883 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 23:51:24,884 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-28 23:51:24,884 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336620835]
[2021-10-28 23:51:24,884 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-28 23:51:24,885 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 23:51:24,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-28 23:51:24,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-28 23:51:24,886 INFO  L87              Difference]: Start difference. First operand 1601 states and 2288 transitions. Second operand  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:25,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 23:51:25,197 INFO  L93              Difference]: Finished difference Result 4783 states and 6836 transitions.
[2021-10-28 23:51:25,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-28 23:51:25,198 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157
[2021-10-28 23:51:25,199 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-28 23:51:25,232 INFO  L225             Difference]: With dead ends: 4783
[2021-10-28 23:51:25,241 INFO  L226             Difference]: Without dead ends: 3190
[2021-10-28 23:51:25,245 INFO  L786         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
[2021-10-28 23:51:25,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3190 states.
[2021-10-28 23:51:25,529 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3188.
[2021-10-28 23:51:25,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3188 states, 3187 states have (on average 1.4032005020395357) internal successors, (4472), 3187 states have internal predecessors, (4472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:25,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4472 transitions.
[2021-10-28 23:51:25,548 INFO  L78                 Accepts]: Start accepts. Automaton has 3188 states and 4472 transitions. Word has length 157
[2021-10-28 23:51:25,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-28 23:51:25,549 INFO  L470      AbstractCegarLoop]: Abstraction has 3188 states and 4472 transitions.
[2021-10-28 23:51:25,549 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 23:51:25,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 3188 states and 4472 transitions.
[2021-10-28 23:51:25,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2021-10-28 23:51:25,554 INFO  L505         BasicCegarLoop]: Found error trace
[2021-10-28 23:51:25,555 INFO  L513         BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 23:51:25,555 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2021-10-28 23:51:25,555 INFO  L402      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-28 23:51:25,556 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 23:51:25,556 INFO  L85        PathProgramCache]: Analyzing trace with hash -3753809, now seen corresponding path program 1 times
[2021-10-28 23:51:25,556 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 23:51:25,556 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158817610]
[2021-10-28 23:51:25,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 23:51:25,557 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 23:51:25,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:51:25,608 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 23:51:25,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 23:51:25,780 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 23:51:25,780 INFO  L627         BasicCegarLoop]: Counterexample is feasible
[2021-10-28 23:51:25,782 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION
[2021-10-28 23:51:25,784 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2021-10-28 23:51:25,788 INFO  L731         BasicCegarLoop]: Path program 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]
[2021-10-28 23:51:25,794 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-10-28 23:51:25,991 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:51:25 BoogieIcfgContainer
[2021-10-28 23:51:25,991 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-28 23:51:25,992 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-28 23:51:25,992 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-28 23:51:25,992 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-28 23:51:25,993 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:51:12" (3/4) ...
[2021-10-28 23:51:25,996 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-28 23:51:26,185 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/witness.graphml
[2021-10-28 23:51:26,185 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-28 23:51:26,187 INFO  L168              Benchmark]: Toolchain (without parser) took 15528.05 ms. Allocated memory was 115.3 MB in the beginning and 222.3 MB in the end (delta: 107.0 MB). Free memory was 74.1 MB in the beginning and 68.4 MB in the end (delta: 5.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,188 INFO  L168              Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 115.3 MB. Free memory is still 90.7 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,189 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 661.03 ms. Allocated memory is still 115.3 MB. Free memory was 73.8 MB in the beginning and 84.4 MB in the end (delta: -10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,190 INFO  L168              Benchmark]: Boogie Procedure Inliner took 98.65 ms. Allocated memory is still 115.3 MB. Free memory was 84.4 MB in the beginning and 81.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,190 INFO  L168              Benchmark]: Boogie Preprocessor took 60.65 ms. Allocated memory is still 115.3 MB. Free memory was 81.4 MB in the beginning and 78.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,191 INFO  L168              Benchmark]: RCFGBuilder took 1214.52 ms. Allocated memory is still 115.3 MB. Free memory was 78.9 MB in the beginning and 47.2 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,197 INFO  L168              Benchmark]: TraceAbstraction took 13289.28 ms. Allocated memory was 115.3 MB in the beginning and 222.3 MB in the end (delta: 107.0 MB). Free memory was 46.7 MB in the beginning and 87.2 MB in the end (delta: -40.5 MB). Peak memory consumption was 68.0 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,197 INFO  L168              Benchmark]: Witness Printer took 193.79 ms. Allocated memory is still 222.3 MB. Free memory was 87.2 MB in the beginning and 68.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
[2021-10-28 23:51:26,201 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.41 ms. Allocated memory is still 115.3 MB. Free memory is still 90.7 MB. There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 661.03 ms. Allocated memory is still 115.3 MB. Free memory was 73.8 MB in the beginning and 84.4 MB in the end (delta: -10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 98.65 ms. Allocated memory is still 115.3 MB. Free memory was 84.4 MB in the beginning and 81.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 60.65 ms. Allocated memory is still 115.3 MB. Free memory was 81.4 MB in the beginning and 78.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 1214.52 ms. Allocated memory is still 115.3 MB. Free memory was 78.9 MB in the beginning and 47.2 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB.
 * TraceAbstraction took 13289.28 ms. Allocated memory was 115.3 MB in the beginning and 222.3 MB in the end (delta: 107.0 MB). Free memory was 46.7 MB in the beginning and 87.2 MB in the end (delta: -40.5 MB). Peak memory consumption was 68.0 MB. Max. memory is 16.1 GB.
 * Witness Printer took 193.79 ms. Allocated memory is still 222.3 MB. Free memory was 87.2 MB in the beginning and 68.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 709]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L714]              int s ;
[L715]              int tmp ;
[L719]              s = 8464
[L24]               int s__info_callback = __VERIFIER_nondet_int() ;
[L25]               int s__in_handshake = __VERIFIER_nondet_int() ;
[L26]               int s__state ;
[L27]               int s__new_session ;
[L28]               int s__server ;
[L29]               int s__version = __VERIFIER_nondet_int() ;
[L30]               int s__type ;
[L31]               int s__init_num ;
[L32]               int s__hit = __VERIFIER_nondet_int() ;
[L33]               int s__rwstate ;
[L34]               int s__init_buf___0 = 1;
[L35]               int s__debug = __VERIFIER_nondet_int() ;
[L36]               int s__shutdown ;
[L37]               int s__cert = __VERIFIER_nondet_int() ;
[L38]               int s__options = __VERIFIER_nondet_int() ;
[L39]               int s__verify_mode = __VERIFIER_nondet_int() ;
[L40]               int s__session__peer = __VERIFIER_nondet_int() ;
[L41]               int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ;
[L42]               int s__ctx__info_callback = __VERIFIER_nondet_int() ;
[L43]               int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ;
[L44]               int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ;
[L45]               int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ;
[L46]               int s__s3__tmp__cert_request ;
[L47]               int s__s3__tmp__reuse_message ;
[L48]               int s__s3__tmp__use_rsa_tmp ;
[L49]               int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ;
[L50]               int s__s3__tmp__new_cipher__algorithms ;
[L51]               int s__s3__tmp__next_state___0 ;
[L52]               int s__s3__tmp__new_cipher__algo_strength ;
[L53]               int s__session__cipher ;
[L54]               int buf ;
[L55]               unsigned long l ;
[L56]               unsigned long Time ;
[L57]               unsigned long tmp ;
[L58]               int cb ;
[L59]               long num1 = __VERIFIER_nondet_long() ;
[L60]               int ret ;
[L61]               int new_state ;
[L62]               int state ;
[L63]               int skip ;
[L64]               int got_new_session ;
[L65]               int tmp___1 = __VERIFIER_nondet_int() ;
[L66]               int tmp___2 = __VERIFIER_nondet_int() ;
[L67]               int tmp___3 = __VERIFIER_nondet_int() ;
[L68]               int tmp___4 = __VERIFIER_nondet_int() ;
[L69]               int tmp___5 = __VERIFIER_nondet_int() ;
[L70]               int tmp___6 = __VERIFIER_nondet_int() ;
[L71]               int tmp___7 ;
[L72]               long tmp___8 = __VERIFIER_nondet_long() ;
[L73]               int tmp___9 = __VERIFIER_nondet_int() ;
[L74]               int tmp___10 = __VERIFIER_nondet_int() ;
[L75]               int blastFlag ;
[L76]               int __cil_tmp55 ;
[L77]               unsigned long __cil_tmp56 ;
[L78]               unsigned long __cil_tmp57 ;
[L79]               unsigned long __cil_tmp58 ;
[L80]               unsigned long __cil_tmp59 ;
[L81]               int __cil_tmp60 ;
[L82]               unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ;
[L86]               s__state = initial_state
[L87]               blastFlag = 0
[L88]               tmp = __VERIFIER_nondet_int()
[L89]               Time = tmp
[L90]               cb = 0
[L91]               ret = -1
[L92]               skip = 0
[L93]               got_new_session = 0
[L94]   COND TRUE   s__info_callback != 0
[L95]               cb = s__info_callback
[L101]              s__in_handshake ++
[L102]  COND FALSE  !(tmp___1 + 12288)
[L107]  COND FALSE  !(s__cert == 0)
[L111]  COND TRUE   1
[L113]              state = s__state
[L114]  COND FALSE  !(s__state == 12292)
[L117]  COND FALSE  !(s__state == 16384)
[L120]  COND FALSE  !(s__state == 8192)
[L123]  COND FALSE  !(s__state == 24576)
[L126]  COND FALSE  !(s__state == 8195)
[L129]  COND FALSE  !(s__state == 8480)
[L132]  COND FALSE  !(s__state == 8481)
[L135]  COND FALSE  !(s__state == 8482)
[L138]  COND TRUE   s__state == 8464
[L284]              s__shutdown = 0
[L285]              ret = __VERIFIER_nondet_int()
[L286]  COND TRUE   blastFlag == 0
[L287]              blastFlag = 1
[L289]  COND FALSE  !(ret <= 0)
[L292]              got_new_session = 1
[L293]              s__state = 8496
[L294]              s__init_num = 0
[L663]              s__s3__tmp__reuse_message = __VERIFIER_nondet_int()
[L664]  COND FALSE  !(! s__s3__tmp__reuse_message)
[L698]              skip = 0
[L111]  COND TRUE   1
[L113]              state = s__state
[L114]  COND FALSE  !(s__state == 12292)
[L117]  COND FALSE  !(s__state == 16384)
[L120]  COND FALSE  !(s__state == 8192)
[L123]  COND FALSE  !(s__state == 24576)
[L126]  COND FALSE  !(s__state == 8195)
[L129]  COND FALSE  !(s__state == 8480)
[L132]  COND FALSE  !(s__state == 8481)
[L135]  COND FALSE  !(s__state == 8482)
[L138]  COND FALSE  !(s__state == 8464)
[L141]  COND FALSE  !(s__state == 8465)
[L144]  COND FALSE  !(s__state == 8466)
[L147]  COND TRUE   s__state == 8496
[L298]              ret = __VERIFIER_nondet_int()
[L299]  COND TRUE   blastFlag == 1
[L300]              blastFlag = 2
[L302]  COND FALSE  !(ret <= 0)
[L305]  COND FALSE  !(\read(s__hit))
[L308]              s__state = 8512
[L310]              s__init_num = 0
[L663]              s__s3__tmp__reuse_message = __VERIFIER_nondet_int()
[L664]  COND FALSE  !(! s__s3__tmp__reuse_message)
[L698]              skip = 0
[L111]  COND TRUE   1
[L113]              state = s__state
[L114]  COND FALSE  !(s__state == 12292)
[L117]  COND FALSE  !(s__state == 16384)
[L120]  COND FALSE  !(s__state == 8192)
[L123]  COND FALSE  !(s__state == 24576)
[L126]  COND FALSE  !(s__state == 8195)
[L129]  COND FALSE  !(s__state == 8480)
[L132]  COND FALSE  !(s__state == 8481)
[L135]  COND FALSE  !(s__state == 8482)
[L138]  COND FALSE  !(s__state == 8464)
[L141]  COND FALSE  !(s__state == 8465)
[L144]  COND FALSE  !(s__state == 8466)
[L147]  COND FALSE  !(s__state == 8496)
[L150]  COND FALSE  !(s__state == 8497)
[L153]  COND TRUE   s__state == 8512
[L315]              s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int()
[L316]              __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms
[L317]  COND TRUE   __cil_tmp56 + 256UL
[L318]              __cil_tmp56 = 256345
[L319]              skip = 1
[L330]              s__state = 8528
[L331]              s__init_num = 0
[L663]              s__s3__tmp__reuse_message = __VERIFIER_nondet_int()
[L664]  COND FALSE  !(! s__s3__tmp__reuse_message)
[L698]              skip = 0
[L111]  COND TRUE   1
[L113]              state = s__state
[L114]  COND FALSE  !(s__state == 12292)
[L117]  COND FALSE  !(s__state == 16384)
[L120]  COND FALSE  !(s__state == 8192)
[L123]  COND FALSE  !(s__state == 24576)
[L126]  COND FALSE  !(s__state == 8195)
[L129]  COND FALSE  !(s__state == 8480)
[L132]  COND FALSE  !(s__state == 8481)
[L135]  COND FALSE  !(s__state == 8482)
[L138]  COND FALSE  !(s__state == 8464)
[L141]  COND FALSE  !(s__state == 8465)
[L144]  COND FALSE  !(s__state == 8466)
[L147]  COND FALSE  !(s__state == 8496)
[L150]  COND FALSE  !(s__state == 8497)
[L153]  COND FALSE  !(s__state == 8512)
[L156]  COND FALSE  !(s__state == 8513)
[L159]  COND TRUE   s__state == 8528
[L335]              s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int()
[L336]              l = (unsigned long )s__s3__tmp__new_cipher__algorithms
[L338]              __cil_tmp57 = (unsigned long )s__options
[L339]  COND TRUE   __cil_tmp57 + 2097152UL
[L340]              s__s3__tmp__use_rsa_tmp = 1
[L345]  COND TRUE   \read(s__s3__tmp__use_rsa_tmp)
[L373]              ret = __VERIFIER_nondet_int()
[L374]  COND FALSE  !(blastFlag == 3)
[L377]  COND FALSE  !(ret <= 0)
[L394]              s__state = 8544
[L395]              s__init_num = 0
[L663]              s__s3__tmp__reuse_message = __VERIFIER_nondet_int()
[L664]  COND FALSE  !(! s__s3__tmp__reuse_message)
[L698]              skip = 0
[L111]  COND TRUE   1
[L113]              state = s__state
[L114]  COND FALSE  !(s__state == 12292)
[L117]  COND FALSE  !(s__state == 16384)
[L120]  COND FALSE  !(s__state == 8192)
[L123]  COND FALSE  !(s__state == 24576)
[L126]  COND FALSE  !(s__state == 8195)
[L129]  COND FALSE  !(s__state == 8480)
[L132]  COND FALSE  !(s__state == 8481)
[L135]  COND FALSE  !(s__state == 8482)
[L138]  COND FALSE  !(s__state == 8464)
[L141]  COND FALSE  !(s__state == 8465)
[L144]  COND FALSE  !(s__state == 8466)
[L147]  COND FALSE  !(s__state == 8496)
[L150]  COND FALSE  !(s__state == 8497)
[L153]  COND FALSE  !(s__state == 8512)
[L156]  COND FALSE  !(s__state == 8513)
[L159]  COND FALSE  !(s__state == 8528)
[L162]  COND FALSE  !(s__state == 8529)
[L165]  COND TRUE   s__state == 8544
[L399]  COND TRUE   s__verify_mode + 1
[L400]  COND TRUE   s__session__peer != 0
[L401]  COND TRUE   s__verify_mode + 4
[L402]              s__verify_mode = 123
[L403]              skip = 1
[L404]              s__s3__tmp__cert_request = 0
[L405]              s__state = 8560
[L663]              s__s3__tmp__reuse_message = __VERIFIER_nondet_int()
[L664]  COND FALSE  !(! s__s3__tmp__reuse_message)
[L698]              skip = 0
[L111]  COND TRUE   1
[L113]              state = s__state
[L114]  COND FALSE  !(s__state == 12292)
[L117]  COND FALSE  !(s__state == 16384)
[L120]  COND FALSE  !(s__state == 8192)
[L123]  COND FALSE  !(s__state == 24576)
[L126]  COND FALSE  !(s__state == 8195)
[L129]  COND FALSE  !(s__state == 8480)
[L132]  COND FALSE  !(s__state == 8481)
[L135]  COND FALSE  !(s__state == 8482)
[L138]  COND FALSE  !(s__state == 8464)
[L141]  COND FALSE  !(s__state == 8465)
[L144]  COND FALSE  !(s__state == 8466)
[L147]  COND FALSE  !(s__state == 8496)
[L150]  COND FALSE  !(s__state == 8497)
[L153]  COND FALSE  !(s__state == 8512)
[L156]  COND FALSE  !(s__state == 8513)
[L159]  COND FALSE  !(s__state == 8528)
[L162]  COND FALSE  !(s__state == 8529)
[L165]  COND FALSE  !(s__state == 8544)
[L168]  COND FALSE  !(s__state == 8545)
[L171]  COND TRUE   s__state == 8560
[L449]              ret = __VERIFIER_nondet_int()
[L450]  COND FALSE  !(ret <= 0)
[L453]              s__s3__tmp__next_state___0 = 8576
[L454]              s__state = 8448
[L455]              s__init_num = 0
[L663]              s__s3__tmp__reuse_message = __VERIFIER_nondet_int()
[L664]  COND TRUE   ! s__s3__tmp__reuse_message
[L665]  COND TRUE   ! skip
[L666]  COND TRUE   state == 8560
[L667]  COND TRUE   s__state == 8448
[L668]  COND TRUE   s__verify_mode != -1
[L669]  COND TRUE   s__verify_mode != -2
[L670]  COND TRUE   __cil_tmp61 != 9021
[L671]  COND TRUE   __cil_tmp58 != 4294967294
[L672]  COND TRUE   blastFlag != 4
[L673]  COND TRUE   tmp___7 != 1024
[L709]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 167 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 35, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7183 SDtfs, 6874 SDslu, 1823 SDs, 0 SdLazy, 2872 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3188occurred in iteration=34, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3216 NumberOfCodeBlocks, 3216 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3025 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2021-10-28 23:51:26,311 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cea20d55-fb32-4e78-b0ce-17bf48883631/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...