./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt --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 602ea7c33e3d58a05b038901c89b84d09b02e08d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-4e77c04 [2021-10-13 00:26:54,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:26:54,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:26:54,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:26:54,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:26:54,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:26:54,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:26:54,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:26:55,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:26:55,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:26:55,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:26:55,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:26:55,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:26:55,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:26:55,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:26:55,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:26:55,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:26:55,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:26:55,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:26:55,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:26:55,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:26:55,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:26:55,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:26:55,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:26:55,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:26:55,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:26:55,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:26:55,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:26:55,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:26:55,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:26:55,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:26:55,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:26:55,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:26:55,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:26:55,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:26:55,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:26:55,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:26:55,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:26:55,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:26:55,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:26:55,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:26:55,072 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:26:55,114 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:26:55,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:26:55,116 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:26:55,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:26:55,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:26:55,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:26:55,119 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:26:55,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:26:55,119 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:26:55,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:26:55,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:26:55,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:26:55,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:26:55,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:26:55,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:26:55,123 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:26:55,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:26:55,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:26:55,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:26:55,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:26:55,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:26:55,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:26:55,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:26:55,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:26:55,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:26:55,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:26:55,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:26:55,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:26:55,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:26:55,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:26:55,129 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_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/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_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt 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 -> 602ea7c33e3d58a05b038901c89b84d09b02e08d [2021-10-13 00:26:55,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:26:55,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:26:55,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:26:55,510 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:26:55,511 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:26:55,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-13 00:26:55,596 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/data/42a761014/9e68b2d78126487bb96c7b5def1e2f85/FLAGd3cf4071a [2021-10-13 00:26:56,311 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:26:56,312 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-13 00:26:56,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/data/42a761014/9e68b2d78126487bb96c7b5def1e2f85/FLAGd3cf4071a [2021-10-13 00:26:56,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/data/42a761014/9e68b2d78126487bb96c7b5def1e2f85 [2021-10-13 00:26:56,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:26:56,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:26:56,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:26:56,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:26:56,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:26:56,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:56" (1/1) ... [2021-10-13 00:26:56,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa38def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:56, skipping insertion in model container [2021-10-13 00:26:56,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:56" (1/1) ... [2021-10-13 00:26:56,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:26:56,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:26:56,963 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_f307bb8d-63f6-4e43-88f1-caad8f31831f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-13 00:26:57,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:26:57,361 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:26:57,413 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_f307bb8d-63f6-4e43-88f1-caad8f31831f/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-13 00:26:57,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:26:57,543 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:26:57,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57 WrapperNode [2021-10-13 00:26:57,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:26:57,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:26:57,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:26:57,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:26:57,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:57,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:57,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:26:57,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:26:57,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:26:57,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:26:57,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:57,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:57,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:57,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:58,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:58,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:58,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:58,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:26:58,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:26:58,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:26:58,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:26:58,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (1/1) ... [2021-10-13 00:26:58,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:26:58,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:26:58,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:26:58,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:26:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:26:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:26:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:26:58,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:26:58,670 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,672 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,684 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,689 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,695 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,701 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,707 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,715 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,719 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,722 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,754 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,759 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,765 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,768 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,771 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,775 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,779 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,782 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,786 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,789 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,792 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,796 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,799 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,801 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,805 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,810 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,813 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,817 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,823 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,826 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,831 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,833 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,837 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,839 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,842 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,844 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,848 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,850 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,854 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,856 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,861 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:26:58,865 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:27:01,261 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-13 00:27:01,261 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-13 00:27:01,262 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-13 00:27:01,262 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-13 00:27:01,262 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-13 00:27:01,262 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-13 00:27:01,262 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-13 00:27:01,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-13 00:27:01,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-13 00:27:01,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-13 00:27:01,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-13 00:27:01,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-13 00:27:01,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-13 00:27:01,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-13 00:27:01,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-13 00:27:01,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-13 00:27:01,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-13 00:27:01,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-13 00:27:01,264 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-13 00:27:01,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-13 00:27:01,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-13 00:27:01,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-13 00:27:01,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-13 00:27:01,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-13 00:27:01,265 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-13 00:27:01,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-13 00:27:01,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-13 00:27:01,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-13 00:27:01,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-13 00:27:01,266 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-13 00:27:01,267 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-13 00:27:01,267 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-13 00:27:01,267 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-13 00:27:01,267 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-13 00:27:01,267 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-13 00:27:01,268 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-13 00:27:01,268 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-13 00:27:01,268 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-13 00:27:01,268 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-13 00:27:01,268 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-13 00:27:01,268 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-13 00:27:01,269 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-13 00:27:01,269 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-13 00:27:01,269 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-13 00:27:01,269 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-13 00:27:01,269 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-13 00:27:01,269 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-13 00:27:01,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-13 00:27:01,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-13 00:27:01,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-13 00:27:01,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-13 00:27:01,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-13 00:27:01,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-13 00:27:01,271 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-13 00:27:01,271 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-13 00:27:01,271 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-13 00:27:01,271 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-13 00:27:01,271 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-13 00:27:01,271 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-13 00:27:01,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-13 00:27:01,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-13 00:27:01,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-13 00:27:01,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-13 00:27:01,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-13 00:27:01,272 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-13 00:27:01,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-13 00:27:01,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-13 00:27:01,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-13 00:27:01,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-13 00:27:01,273 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-13 00:27:01,274 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-13 00:27:01,275 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-13 00:27:01,275 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-13 00:27:01,275 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-13 00:27:01,275 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-13 00:27:01,275 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-13 00:27:01,275 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-13 00:27:01,276 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-13 00:27:01,276 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-13 00:27:01,276 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-13 00:27:01,276 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-13 00:27:01,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:27:01,298 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-13 00:27:01,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:27:01 BoogieIcfgContainer [2021-10-13 00:27:01,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:27:01,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:27:01,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:27:01,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:27:01,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:26:56" (1/3) ... [2021-10-13 00:27:01,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2111cdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:27:01, skipping insertion in model container [2021-10-13 00:27:01,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:57" (2/3) ... [2021-10-13 00:27:01,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2111cdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:27:01, skipping insertion in model container [2021-10-13 00:27:01,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:27:01" (3/3) ... [2021-10-13 00:27:01,312 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-13 00:27:01,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:27:01,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-13 00:27:01,386 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:27:01,394 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, mConcurrency=FINITE_AUTOMATA, 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-13 00:27:01,394 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-13 00:27:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 1185 states, 1081 states have (on average 1.6327474560592043) internal successors, (1765), 1184 states have internal predecessors, (1765), 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-13 00:27:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:27:01,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:01,451 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:01,452 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -630605601, now seen corresponding path program 1 times [2021-10-13 00:27:01,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:01,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574086887] [2021-10-13 00:27:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:01,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:01,702 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-13 00:27:01,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:01,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574086887] [2021-10-13 00:27:01,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574086887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:01,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:01,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:01,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436191351] [2021-10-13 00:27:01,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:01,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:01,737 INFO L87 Difference]: Start difference. First operand has 1185 states, 1081 states have (on average 1.6327474560592043) internal successors, (1765), 1184 states have internal predecessors, (1765), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 00:27:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:02,413 INFO L93 Difference]: Finished difference Result 2072 states and 3036 transitions. [2021-10-13 00:27:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:02,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-10-13 00:27:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:02,444 INFO L225 Difference]: With dead ends: 2072 [2021-10-13 00:27:02,444 INFO L226 Difference]: Without dead ends: 1180 [2021-10-13 00:27:02,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-10-13 00:27:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2021-10-13 00:27:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1077 states have (on average 1.5273909006499535) internal successors, (1645), 1179 states have internal predecessors, (1645), 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-13 00:27:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1645 transitions. [2021-10-13 00:27:02,591 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1645 transitions. Word has length 11 [2021-10-13 00:27:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:02,592 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1645 transitions. [2021-10-13 00:27:02,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 00:27:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1645 transitions. [2021-10-13 00:27:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:27:02,594 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:02,595 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:02,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:27:02,596 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1724813645, now seen corresponding path program 1 times [2021-10-13 00:27:02,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:02,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748941099] [2021-10-13 00:27:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:02,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:02,688 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-13 00:27:02,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:02,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748941099] [2021-10-13 00:27:02,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748941099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:02,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:02,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:02,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095481734] [2021-10-13 00:27:02,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:02,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:02,694 INFO L87 Difference]: Start difference. First operand 1180 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 00:27:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:03,306 INFO L93 Difference]: Finished difference Result 1458 states and 2013 transitions. [2021-10-13 00:27:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-10-13 00:27:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:03,316 INFO L225 Difference]: With dead ends: 1458 [2021-10-13 00:27:03,317 INFO L226 Difference]: Without dead ends: 1261 [2021-10-13 00:27:03,319 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2021-10-13 00:27:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1235. [2021-10-13 00:27:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1168 states have (on average 1.4931506849315068) internal successors, (1744), 1234 states have internal predecessors, (1744), 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-13 00:27:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1744 transitions. [2021-10-13 00:27:03,374 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1744 transitions. Word has length 12 [2021-10-13 00:27:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:03,374 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1744 transitions. [2021-10-13 00:27:03,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-13 00:27:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1744 transitions. [2021-10-13 00:27:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 00:27:03,378 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:03,378 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:03,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:27:03,379 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash 375851837, now seen corresponding path program 1 times [2021-10-13 00:27:03,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:03,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794280945] [2021-10-13 00:27:03,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:03,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:03,514 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-13 00:27:03,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:03,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794280945] [2021-10-13 00:27:03,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794280945] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:03,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:03,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:03,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649273778] [2021-10-13 00:27:03,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:03,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:03,525 INFO L87 Difference]: Start difference. First operand 1235 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:27:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:03,616 INFO L93 Difference]: Finished difference Result 1625 states and 2261 transitions. [2021-10-13 00:27:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-10-13 00:27:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:03,627 INFO L225 Difference]: With dead ends: 1625 [2021-10-13 00:27:03,627 INFO L226 Difference]: Without dead ends: 1265 [2021-10-13 00:27:03,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-10-13 00:27:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1076. [2021-10-13 00:27:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1030 states have (on average 1.4776699029126215) internal successors, (1522), 1075 states have internal predecessors, (1522), 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-13 00:27:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1522 transitions. [2021-10-13 00:27:03,717 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1522 transitions. Word has length 14 [2021-10-13 00:27:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:03,718 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1522 transitions. [2021-10-13 00:27:03,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 00:27:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1522 transitions. [2021-10-13 00:27:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:27:03,721 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:03,722 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:03,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:27:03,722 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1788319990, now seen corresponding path program 1 times [2021-10-13 00:27:03,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:03,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163013813] [2021-10-13 00:27:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:03,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:03,797 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-13 00:27:03,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:03,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163013813] [2021-10-13 00:27:03,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163013813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:03,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:03,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:03,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383167256] [2021-10-13 00:27:03,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:03,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:03,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:03,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:03,802 INFO L87 Difference]: Start difference. First operand 1076 states and 1522 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 00:27:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:04,353 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2021-10-13 00:27:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:04,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-10-13 00:27:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:04,368 INFO L225 Difference]: With dead ends: 1775 [2021-10-13 00:27:04,369 INFO L226 Difference]: Without dead ends: 1539 [2021-10-13 00:27:04,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2021-10-13 00:27:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1245. [2021-10-13 00:27:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1199 states have (on average 1.4795663052543786) internal successors, (1774), 1244 states have internal predecessors, (1774), 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-13 00:27:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1774 transitions. [2021-10-13 00:27:04,448 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1774 transitions. Word has length 16 [2021-10-13 00:27:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:04,448 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 1774 transitions. [2021-10-13 00:27:04,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 00:27:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1774 transitions. [2021-10-13 00:27:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:27:04,458 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:04,459 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:04,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:27:04,459 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:04,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 388999750, now seen corresponding path program 1 times [2021-10-13 00:27:04,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:04,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486518474] [2021-10-13 00:27:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:04,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:04,575 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-13 00:27:04,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:04,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486518474] [2021-10-13 00:27:04,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486518474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:04,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:04,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:04,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654473996] [2021-10-13 00:27:04,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:04,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:04,579 INFO L87 Difference]: Start difference. First operand 1245 states and 1774 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-13 00:27:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:05,199 INFO L93 Difference]: Finished difference Result 1870 states and 2623 transitions. [2021-10-13 00:27:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-10-13 00:27:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:05,208 INFO L225 Difference]: With dead ends: 1870 [2021-10-13 00:27:05,209 INFO L226 Difference]: Without dead ends: 1146 [2021-10-13 00:27:05,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-13 00:27:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1028. [2021-10-13 00:27:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1004 states have (on average 1.4262948207171315) internal successors, (1432), 1027 states have internal predecessors, (1432), 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-13 00:27:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1432 transitions. [2021-10-13 00:27:05,283 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1432 transitions. Word has length 17 [2021-10-13 00:27:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:05,284 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1432 transitions. [2021-10-13 00:27:05,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-13 00:27:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1432 transitions. [2021-10-13 00:27:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:27:05,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:05,286 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:05,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:27:05,287 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash 79997488, now seen corresponding path program 1 times [2021-10-13 00:27:05,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:05,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853572693] [2021-10-13 00:27:05,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:05,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:05,343 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-13 00:27:05,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:05,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853572693] [2021-10-13 00:27:05,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853572693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:05,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:05,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:05,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234013913] [2021-10-13 00:27:05,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:05,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:05,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:05,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:05,347 INFO L87 Difference]: Start difference. First operand 1028 states and 1432 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 00:27:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:05,485 INFO L93 Difference]: Finished difference Result 1343 states and 1857 transitions. [2021-10-13 00:27:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:27:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-10-13 00:27:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:05,498 INFO L225 Difference]: With dead ends: 1343 [2021-10-13 00:27:05,499 INFO L226 Difference]: Without dead ends: 1093 [2021-10-13 00:27:05,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-10-13 00:27:05,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1012. [2021-10-13 00:27:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 990 states have (on average 1.4202020202020202) internal successors, (1406), 1011 states have internal predecessors, (1406), 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-13 00:27:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1406 transitions. [2021-10-13 00:27:05,576 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1406 transitions. Word has length 19 [2021-10-13 00:27:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:05,577 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1406 transitions. [2021-10-13 00:27:05,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 00:27:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1406 transitions. [2021-10-13 00:27:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 00:27:05,579 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:05,579 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:27:05,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:27:05,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2053267823, now seen corresponding path program 1 times [2021-10-13 00:27:05,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:05,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820710146] [2021-10-13 00:27:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:05,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:05,670 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-13 00:27:05,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:05,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820710146] [2021-10-13 00:27:05,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820710146] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:05,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:05,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:05,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039416820] [2021-10-13 00:27:05,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:05,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:05,673 INFO L87 Difference]: Start difference. First operand 1012 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 00:27:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:05,996 INFO L93 Difference]: Finished difference Result 1012 states and 1406 transitions. [2021-10-13 00:27:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2021-10-13 00:27:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:06,004 INFO L225 Difference]: With dead ends: 1012 [2021-10-13 00:27:06,004 INFO L226 Difference]: Without dead ends: 994 [2021-10-13 00:27:06,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-10-13 00:27:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2021-10-13 00:27:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 981 states have (on average 1.4148827726809379) internal successors, (1388), 993 states have internal predecessors, (1388), 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-13 00:27:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1388 transitions. [2021-10-13 00:27:06,087 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1388 transitions. Word has length 20 [2021-10-13 00:27:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:06,087 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1388 transitions. [2021-10-13 00:27:06,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 00:27:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1388 transitions. [2021-10-13 00:27:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:27:06,090 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:06,090 INFO L512 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] [2021-10-13 00:27:06,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:27:06,091 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:06,092 INFO L82 PathProgramCache]: Analyzing trace with hash -99023241, now seen corresponding path program 1 times [2021-10-13 00:27:06,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:06,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027979375] [2021-10-13 00:27:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:06,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:06,134 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-13 00:27:06,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:06,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027979375] [2021-10-13 00:27:06,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027979375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:06,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:06,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:06,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352736300] [2021-10-13 00:27:06,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:06,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:06,137 INFO L87 Difference]: Start difference. First operand 994 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 00:27:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:06,232 INFO L93 Difference]: Finished difference Result 1071 states and 1485 transitions. [2021-10-13 00:27:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2021-10-13 00:27:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:06,240 INFO L225 Difference]: With dead ends: 1071 [2021-10-13 00:27:06,241 INFO L226 Difference]: Without dead ends: 1048 [2021-10-13 00:27:06,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:06,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-10-13 00:27:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 999. [2021-10-13 00:27:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 987 states have (on average 1.4285714285714286) internal successors, (1410), 998 states have internal predecessors, (1410), 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-13 00:27:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1410 transitions. [2021-10-13 00:27:06,318 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1410 transitions. Word has length 22 [2021-10-13 00:27:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:06,319 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1410 transitions. [2021-10-13 00:27:06,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-13 00:27:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1410 transitions. [2021-10-13 00:27:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:27:06,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:06,322 INFO L512 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] [2021-10-13 00:27:06,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:27:06,323 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 85424501, now seen corresponding path program 1 times [2021-10-13 00:27:06,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:06,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492753127] [2021-10-13 00:27:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:06,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:06,395 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-13 00:27:06,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:06,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492753127] [2021-10-13 00:27:06,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492753127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:06,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:06,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:06,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387524698] [2021-10-13 00:27:06,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:06,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:06,405 INFO L87 Difference]: Start difference. First operand 999 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 00:27:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:06,500 INFO L93 Difference]: Finished difference Result 1274 states and 1786 transitions. [2021-10-13 00:27:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-10-13 00:27:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:06,511 INFO L225 Difference]: With dead ends: 1274 [2021-10-13 00:27:06,512 INFO L226 Difference]: Without dead ends: 1045 [2021-10-13 00:27:06,513 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-10-13 00:27:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 999. [2021-10-13 00:27:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 987 states have (on average 1.426545086119554) internal successors, (1408), 998 states have internal predecessors, (1408), 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-13 00:27:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1408 transitions. [2021-10-13 00:27:06,602 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1408 transitions. Word has length 25 [2021-10-13 00:27:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:06,603 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1408 transitions. [2021-10-13 00:27:06,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 00:27:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1408 transitions. [2021-10-13 00:27:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 00:27:06,606 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:06,606 INFO L512 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] [2021-10-13 00:27:06,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:27:06,608 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash -105580495, now seen corresponding path program 1 times [2021-10-13 00:27:06,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:06,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557290683] [2021-10-13 00:27:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:06,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:06,689 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-13 00:27:06,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:06,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557290683] [2021-10-13 00:27:06,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557290683] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:06,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:06,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:06,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041884319] [2021-10-13 00:27:06,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:06,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:06,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:06,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:06,694 INFO L87 Difference]: Start difference. First operand 999 states and 1408 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 00:27:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:07,054 INFO L93 Difference]: Finished difference Result 1196 states and 1676 transitions. [2021-10-13 00:27:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:07,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-10-13 00:27:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:07,063 INFO L225 Difference]: With dead ends: 1196 [2021-10-13 00:27:07,063 INFO L226 Difference]: Without dead ends: 989 [2021-10-13 00:27:07,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-13 00:27:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2021-10-13 00:27:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.4214285714285715) internal successors, (1393), 988 states have internal predecessors, (1393), 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-13 00:27:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1393 transitions. [2021-10-13 00:27:07,164 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1393 transitions. Word has length 27 [2021-10-13 00:27:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:07,165 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1393 transitions. [2021-10-13 00:27:07,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 00:27:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1393 transitions. [2021-10-13 00:27:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:27:07,172 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:07,172 INFO L512 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-13 00:27:07,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:27:07,173 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:07,174 INFO L82 PathProgramCache]: Analyzing trace with hash 333752835, now seen corresponding path program 1 times [2021-10-13 00:27:07,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:07,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957198062] [2021-10-13 00:27:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:07,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:07,280 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-13 00:27:07,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:07,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957198062] [2021-10-13 00:27:07,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957198062] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:07,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:07,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:07,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818952119] [2021-10-13 00:27:07,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:07,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:07,286 INFO L87 Difference]: Start difference. First operand 989 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-13 00:27:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:07,716 INFO L93 Difference]: Finished difference Result 1061 states and 1469 transitions. [2021-10-13 00:27:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-13 00:27:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:07,723 INFO L225 Difference]: With dead ends: 1061 [2021-10-13 00:27:07,723 INFO L226 Difference]: Without dead ends: 1009 [2021-10-13 00:27:07,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-13 00:27:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2021-10-13 00:27:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.4122448979591837) internal successors, (1384), 988 states have internal predecessors, (1384), 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-13 00:27:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1384 transitions. [2021-10-13 00:27:07,793 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1384 transitions. Word has length 29 [2021-10-13 00:27:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:07,794 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1384 transitions. [2021-10-13 00:27:07,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 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-13 00:27:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1384 transitions. [2021-10-13 00:27:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-13 00:27:07,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:07,797 INFO L512 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-13 00:27:07,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:27:07,798 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1053614682, now seen corresponding path program 1 times [2021-10-13 00:27:07,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:07,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970336143] [2021-10-13 00:27:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:07,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:07,851 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-13 00:27:07,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:07,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970336143] [2021-10-13 00:27:07,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970336143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:07,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:07,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:07,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406093410] [2021-10-13 00:27:07,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:07,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:07,855 INFO L87 Difference]: Start difference. First operand 989 states and 1384 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-13 00:27:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:08,101 INFO L93 Difference]: Finished difference Result 1014 states and 1412 transitions. [2021-10-13 00:27:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:08,102 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-13 00:27:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:08,108 INFO L225 Difference]: With dead ends: 1014 [2021-10-13 00:27:08,108 INFO L226 Difference]: Without dead ends: 1009 [2021-10-13 00:27:08,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-13 00:27:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-13 00:27:08,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 997 states have (on average 1.4092276830491475) internal successors, (1405), 1005 states have internal predecessors, (1405), 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-13 00:27:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1405 transitions. [2021-10-13 00:27:08,190 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1405 transitions. Word has length 30 [2021-10-13 00:27:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:08,191 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1405 transitions. [2021-10-13 00:27:08,191 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-13 00:27:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1405 transitions. [2021-10-13 00:27:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:27:08,194 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:08,194 INFO L512 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-13 00:27:08,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:27:08,194 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1714895974, now seen corresponding path program 1 times [2021-10-13 00:27:08,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:08,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612249623] [2021-10-13 00:27:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:08,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:08,254 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-13 00:27:08,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:08,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612249623] [2021-10-13 00:27:08,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612249623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:08,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:08,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:08,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411449234] [2021-10-13 00:27:08,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:08,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:08,258 INFO L87 Difference]: Start difference. First operand 1006 states and 1405 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:08,540 INFO L93 Difference]: Finished difference Result 1014 states and 1411 transitions. [2021-10-13 00:27:08,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:08,547 INFO L225 Difference]: With dead ends: 1014 [2021-10-13 00:27:08,547 INFO L226 Difference]: Without dead ends: 1009 [2021-10-13 00:27:08,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-13 00:27:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-13 00:27:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 997 states have (on average 1.4082246740220663) internal successors, (1404), 1005 states have internal predecessors, (1404), 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-13 00:27:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1404 transitions. [2021-10-13 00:27:08,612 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1404 transitions. Word has length 31 [2021-10-13 00:27:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:08,613 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1404 transitions. [2021-10-13 00:27:08,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1404 transitions. [2021-10-13 00:27:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:27:08,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:08,616 INFO L512 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-13 00:27:08,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:27:08,616 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1557214583, now seen corresponding path program 1 times [2021-10-13 00:27:08,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:08,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517718589] [2021-10-13 00:27:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:08,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:08,649 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-13 00:27:08,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:08,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517718589] [2021-10-13 00:27:08,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517718589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:08,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:08,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:08,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824807973] [2021-10-13 00:27:08,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:08,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:08,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:08,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:08,652 INFO L87 Difference]: Start difference. First operand 1006 states and 1404 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-13 00:27:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:08,735 INFO L93 Difference]: Finished difference Result 1237 states and 1712 transitions. [2021-10-13 00:27:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:08,735 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-13 00:27:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:08,741 INFO L225 Difference]: With dead ends: 1237 [2021-10-13 00:27:08,742 INFO L226 Difference]: Without dead ends: 1099 [2021-10-13 00:27:08,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-10-13 00:27:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 994. [2021-10-13 00:27:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.402834008097166) internal successors, (1386), 993 states have internal predecessors, (1386), 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-13 00:27:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1386 transitions. [2021-10-13 00:27:08,808 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1386 transitions. Word has length 31 [2021-10-13 00:27:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:08,809 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1386 transitions. [2021-10-13 00:27:08,809 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-13 00:27:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1386 transitions. [2021-10-13 00:27:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:27:08,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:08,811 INFO L512 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-13 00:27:08,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:27:08,812 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1095917288, now seen corresponding path program 1 times [2021-10-13 00:27:08,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:08,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568797249] [2021-10-13 00:27:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:08,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:08,841 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-13 00:27:08,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:08,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568797249] [2021-10-13 00:27:08,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568797249] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:08,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:08,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:08,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068350418] [2021-10-13 00:27:08,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:08,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:08,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:08,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:08,844 INFO L87 Difference]: Start difference. First operand 994 states and 1386 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-13 00:27:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:09,092 INFO L93 Difference]: Finished difference Result 1060 states and 1453 transitions. [2021-10-13 00:27:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:09,093 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-13 00:27:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:09,100 INFO L225 Difference]: With dead ends: 1060 [2021-10-13 00:27:09,100 INFO L226 Difference]: Without dead ends: 1046 [2021-10-13 00:27:09,101 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-10-13 00:27:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1034. [2021-10-13 00:27:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1028 states have (on average 1.3881322957198443) internal successors, (1427), 1033 states have internal predecessors, (1427), 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-13 00:27:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1427 transitions. [2021-10-13 00:27:09,178 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1427 transitions. Word has length 31 [2021-10-13 00:27:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:09,179 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 1427 transitions. [2021-10-13 00:27:09,179 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-13 00:27:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1427 transitions. [2021-10-13 00:27:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:27:09,182 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:09,182 INFO L512 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-13 00:27:09,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:27:09,183 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1102324248, now seen corresponding path program 1 times [2021-10-13 00:27:09,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:09,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834669660] [2021-10-13 00:27:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:09,184 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:09,233 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-13 00:27:09,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:09,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834669660] [2021-10-13 00:27:09,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834669660] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:09,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:09,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:09,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570877085] [2021-10-13 00:27:09,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:09,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:09,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:09,236 INFO L87 Difference]: Start difference. First operand 1034 states and 1427 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:09,334 INFO L93 Difference]: Finished difference Result 1101 states and 1500 transitions. [2021-10-13 00:27:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:09,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:09,341 INFO L225 Difference]: With dead ends: 1101 [2021-10-13 00:27:09,342 INFO L226 Difference]: Without dead ends: 1078 [2021-10-13 00:27:09,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-10-13 00:27:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1037. [2021-10-13 00:27:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1031 states have (on average 1.3879728419010668) internal successors, (1431), 1036 states have internal predecessors, (1431), 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-13 00:27:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1431 transitions. [2021-10-13 00:27:09,418 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1431 transitions. Word has length 31 [2021-10-13 00:27:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:09,418 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1431 transitions. [2021-10-13 00:27:09,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1431 transitions. [2021-10-13 00:27:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 00:27:09,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:09,422 INFO L512 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-13 00:27:09,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:27:09,422 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1689130262, now seen corresponding path program 1 times [2021-10-13 00:27:09,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:09,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388946050] [2021-10-13 00:27:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:09,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:09,483 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-13 00:27:09,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:09,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388946050] [2021-10-13 00:27:09,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388946050] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:09,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:09,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:09,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262101460] [2021-10-13 00:27:09,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:09,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:09,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:09,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:09,488 INFO L87 Difference]: Start difference. First operand 1037 states and 1431 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:09,803 INFO L93 Difference]: Finished difference Result 1060 states and 1456 transitions. [2021-10-13 00:27:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:09,807 INFO L225 Difference]: With dead ends: 1060 [2021-10-13 00:27:09,808 INFO L226 Difference]: Without dead ends: 996 [2021-10-13 00:27:09,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-13 00:27:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 994. [2021-10-13 00:27:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.3856275303643724) internal successors, (1369), 993 states have internal predecessors, (1369), 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-13 00:27:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1369 transitions. [2021-10-13 00:27:09,881 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1369 transitions. Word has length 31 [2021-10-13 00:27:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:09,881 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1369 transitions. [2021-10-13 00:27:09,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-13 00:27:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1369 transitions. [2021-10-13 00:27:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:27:09,884 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:09,884 INFO L512 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-13 00:27:09,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:27:09,885 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1100290421, now seen corresponding path program 1 times [2021-10-13 00:27:09,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:09,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167743172] [2021-10-13 00:27:09,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:09,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:09,958 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-13 00:27:09,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:09,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167743172] [2021-10-13 00:27:09,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167743172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:09,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:09,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:09,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752653876] [2021-10-13 00:27:09,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:09,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:09,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:09,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:09,963 INFO L87 Difference]: Start difference. First operand 994 states and 1369 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-13 00:27:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:10,251 INFO L93 Difference]: Finished difference Result 1002 states and 1375 transitions. [2021-10-13 00:27:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:10,252 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-13 00:27:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:10,258 INFO L225 Difference]: With dead ends: 1002 [2021-10-13 00:27:10,258 INFO L226 Difference]: Without dead ends: 997 [2021-10-13 00:27:10,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-10-13 00:27:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2021-10-13 00:27:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.3846153846153846) internal successors, (1368), 993 states have internal predecessors, (1368), 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-13 00:27:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1368 transitions. [2021-10-13 00:27:10,337 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1368 transitions. Word has length 32 [2021-10-13 00:27:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:10,338 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1368 transitions. [2021-10-13 00:27:10,338 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-13 00:27:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1368 transitions. [2021-10-13 00:27:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:27:10,341 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:10,341 INFO L512 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-13 00:27:10,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:27:10,342 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 635619136, now seen corresponding path program 1 times [2021-10-13 00:27:10,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:10,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744297623] [2021-10-13 00:27:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:10,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:10,383 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-13 00:27:10,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:10,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744297623] [2021-10-13 00:27:10,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744297623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:10,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:10,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:10,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779669457] [2021-10-13 00:27:10,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:10,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:10,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:10,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:10,388 INFO L87 Difference]: Start difference. First operand 994 states and 1368 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-13 00:27:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:10,471 INFO L93 Difference]: Finished difference Result 1095 states and 1504 transitions. [2021-10-13 00:27:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:10,472 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-13 00:27:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:10,478 INFO L225 Difference]: With dead ends: 1095 [2021-10-13 00:27:10,478 INFO L226 Difference]: Without dead ends: 978 [2021-10-13 00:27:10,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-10-13 00:27:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2021-10-13 00:27:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 972 states have (on average 1.3775720164609053) internal successors, (1339), 977 states have internal predecessors, (1339), 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-13 00:27:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1339 transitions. [2021-10-13 00:27:10,570 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1339 transitions. Word has length 32 [2021-10-13 00:27:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:10,570 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 1339 transitions. [2021-10-13 00:27:10,570 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-13 00:27:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1339 transitions. [2021-10-13 00:27:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:27:10,573 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:10,573 INFO L512 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-13 00:27:10,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:27:10,574 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -369077776, now seen corresponding path program 1 times [2021-10-13 00:27:10,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:10,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363962203] [2021-10-13 00:27:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:10,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:10,626 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-13 00:27:10,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:10,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363962203] [2021-10-13 00:27:10,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363962203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:10,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:10,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:27:10,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807498454] [2021-10-13 00:27:10,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:27:10,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:27:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:27:10,629 INFO L87 Difference]: Start difference. First operand 978 states and 1339 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-13 00:27:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:10,797 INFO L93 Difference]: Finished difference Result 992 states and 1353 transitions. [2021-10-13 00:27:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:27:10,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-13 00:27:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:10,803 INFO L225 Difference]: With dead ends: 992 [2021-10-13 00:27:10,803 INFO L226 Difference]: Without dead ends: 989 [2021-10-13 00:27:10,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-13 00:27:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 984. [2021-10-13 00:27:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 978 states have (on average 1.3762781186094069) internal successors, (1346), 983 states have internal predecessors, (1346), 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-13 00:27:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1346 transitions. [2021-10-13 00:27:10,876 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1346 transitions. Word has length 32 [2021-10-13 00:27:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:10,876 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1346 transitions. [2021-10-13 00:27:10,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-13 00:27:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1346 transitions. [2021-10-13 00:27:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:27:10,881 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:10,882 INFO L512 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-13 00:27:10,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:27:10,882 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash -369089692, now seen corresponding path program 1 times [2021-10-13 00:27:10,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:10,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905872384] [2021-10-13 00:27:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:10,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:10,925 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-13 00:27:10,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:10,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905872384] [2021-10-13 00:27:10,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905872384] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:10,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:10,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:27:10,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093079162] [2021-10-13 00:27:10,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:27:10,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:27:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:27:10,929 INFO L87 Difference]: Start difference. First operand 984 states and 1346 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-13 00:27:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:11,048 INFO L93 Difference]: Finished difference Result 1001 states and 1363 transitions. [2021-10-13 00:27:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:27:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-13 00:27:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:11,055 INFO L225 Difference]: With dead ends: 1001 [2021-10-13 00:27:11,055 INFO L226 Difference]: Without dead ends: 983 [2021-10-13 00:27:11,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-13 00:27:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2021-10-13 00:27:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 977 states have (on average 1.375639713408393) internal successors, (1344), 982 states have internal predecessors, (1344), 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-13 00:27:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1344 transitions. [2021-10-13 00:27:11,142 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1344 transitions. Word has length 32 [2021-10-13 00:27:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:11,142 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1344 transitions. [2021-10-13 00:27:11,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-13 00:27:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1344 transitions. [2021-10-13 00:27:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:27:11,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:11,146 INFO L512 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] [2021-10-13 00:27:11,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:27:11,146 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash -603608195, now seen corresponding path program 1 times [2021-10-13 00:27:11,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:11,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060355300] [2021-10-13 00:27:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:11,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:11,205 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-13 00:27:11,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:11,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060355300] [2021-10-13 00:27:11,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060355300] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:11,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:11,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:27:11,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525881275] [2021-10-13 00:27:11,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:27:11,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:11,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:27:11,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:11,208 INFO L87 Difference]: Start difference. First operand 983 states and 1344 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 00:27:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:11,453 INFO L93 Difference]: Finished difference Result 1004 states and 1366 transitions. [2021-10-13 00:27:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 33 [2021-10-13 00:27:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:11,461 INFO L225 Difference]: With dead ends: 1004 [2021-10-13 00:27:11,461 INFO L226 Difference]: Without dead ends: 974 [2021-10-13 00:27:11,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-13 00:27:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2021-10-13 00:27:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.365702479338843) internal successors, (1322), 973 states have internal predecessors, (1322), 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-13 00:27:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-13 00:27:11,556 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-13 00:27:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:11,557 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-13 00:27:11,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 00:27:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-13 00:27:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:27:11,561 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:11,561 INFO L512 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] [2021-10-13 00:27:11,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:27:11,561 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:11,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash -691762275, now seen corresponding path program 1 times [2021-10-13 00:27:11,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:11,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496889768] [2021-10-13 00:27:11,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:11,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:11,671 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-13 00:27:11,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:11,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496889768] [2021-10-13 00:27:11,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496889768] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:11,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:11,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:27:11,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472992090] [2021-10-13 00:27:11,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:27:11,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:27:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:11,676 INFO L87 Difference]: Start difference. First operand 974 states and 1322 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 00:27:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:12,113 INFO L93 Difference]: Finished difference Result 1009 states and 1356 transitions. [2021-10-13 00:27:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 33 [2021-10-13 00:27:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:12,120 INFO L225 Difference]: With dead ends: 1009 [2021-10-13 00:27:12,120 INFO L226 Difference]: Without dead ends: 1006 [2021-10-13 00:27:12,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 96.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-13 00:27:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2021-10-13 00:27:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.365702479338843) internal successors, (1322), 973 states have internal predecessors, (1322), 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-13 00:27:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-13 00:27:12,203 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-13 00:27:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:12,204 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-13 00:27:12,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 00:27:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-13 00:27:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:27:12,206 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:12,207 INFO L512 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] [2021-10-13 00:27:12,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:27:12,207 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash -691774191, now seen corresponding path program 1 times [2021-10-13 00:27:12,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:12,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463689980] [2021-10-13 00:27:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:12,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:12,271 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-13 00:27:12,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:12,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463689980] [2021-10-13 00:27:12,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463689980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:12,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:12,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:12,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59716695] [2021-10-13 00:27:12,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:12,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:12,274 INFO L87 Difference]: Start difference. First operand 974 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 00:27:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:12,590 INFO L93 Difference]: Finished difference Result 985 states and 1333 transitions. [2021-10-13 00:27:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:12,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2021-10-13 00:27:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:12,606 INFO L225 Difference]: With dead ends: 985 [2021-10-13 00:27:12,610 INFO L226 Difference]: Without dead ends: 926 [2021-10-13 00:27:12,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-10-13 00:27:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2021-10-13 00:27:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 917 states have (on average 1.3751363140676118) internal successors, (1261), 922 states have internal predecessors, (1261), 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-13 00:27:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1261 transitions. [2021-10-13 00:27:12,688 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1261 transitions. Word has length 33 [2021-10-13 00:27:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:12,688 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1261 transitions. [2021-10-13 00:27:12,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-13 00:27:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1261 transitions. [2021-10-13 00:27:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:27:12,691 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:12,691 INFO L512 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] [2021-10-13 00:27:12,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:27:12,691 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2061346662, now seen corresponding path program 1 times [2021-10-13 00:27:12,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:12,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676124145] [2021-10-13 00:27:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:12,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:12,794 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-13 00:27:12,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:12,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676124145] [2021-10-13 00:27:12,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676124145] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:12,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:12,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:27:12,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770685329] [2021-10-13 00:27:12,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:12,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:12,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:12,797 INFO L87 Difference]: Start difference. First operand 923 states and 1261 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-13 00:27:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:13,093 INFO L93 Difference]: Finished difference Result 945 states and 1284 transitions. [2021-10-13 00:27:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:27:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 34 [2021-10-13 00:27:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:13,113 INFO L225 Difference]: With dead ends: 945 [2021-10-13 00:27:13,113 INFO L226 Difference]: Without dead ends: 917 [2021-10-13 00:27:13,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 100.3ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:27:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-13 00:27:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2021-10-13 00:27:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 911 states have (on average 1.3644346871569704) internal successors, (1243), 916 states have internal predecessors, (1243), 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-13 00:27:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1243 transitions. [2021-10-13 00:27:13,196 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1243 transitions. Word has length 34 [2021-10-13 00:27:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:13,197 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1243 transitions. [2021-10-13 00:27:13,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-13 00:27:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1243 transitions. [2021-10-13 00:27:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:27:13,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:13,200 INFO L512 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] [2021-10-13 00:27:13,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:27:13,200 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash -842658898, now seen corresponding path program 1 times [2021-10-13 00:27:13,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:13,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256166365] [2021-10-13 00:27:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:13,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:13,226 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-13 00:27:13,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:13,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256166365] [2021-10-13 00:27:13,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256166365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:13,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:13,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:13,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70242800] [2021-10-13 00:27:13,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:13,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:13,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:13,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:13,229 INFO L87 Difference]: Start difference. First operand 917 states and 1243 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 00:27:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:13,376 INFO L93 Difference]: Finished difference Result 1290 states and 1738 transitions. [2021-10-13 00:27:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-10-13 00:27:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:13,380 INFO L225 Difference]: With dead ends: 1290 [2021-10-13 00:27:13,381 INFO L226 Difference]: Without dead ends: 1114 [2021-10-13 00:27:13,381 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-10-13 00:27:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 917. [2021-10-13 00:27:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 911 states have (on average 1.353457738748628) internal successors, (1233), 916 states have internal predecessors, (1233), 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-13 00:27:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1233 transitions. [2021-10-13 00:27:13,465 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1233 transitions. Word has length 34 [2021-10-13 00:27:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:13,465 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1233 transitions. [2021-10-13 00:27:13,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 00:27:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1233 transitions. [2021-10-13 00:27:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:27:13,468 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:13,468 INFO L512 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] [2021-10-13 00:27:13,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:27:13,469 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash -419957072, now seen corresponding path program 1 times [2021-10-13 00:27:13,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:13,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291690961] [2021-10-13 00:27:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:13,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:13,521 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-13 00:27:13,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:13,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291690961] [2021-10-13 00:27:13,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291690961] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:13,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:13,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:27:13,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845905824] [2021-10-13 00:27:13,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:27:13,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:13,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:27:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:13,524 INFO L87 Difference]: Start difference. First operand 917 states and 1233 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-13 00:27:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:13,668 INFO L93 Difference]: Finished difference Result 933 states and 1249 transitions. [2021-10-13 00:27:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:13,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2021-10-13 00:27:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:13,672 INFO L225 Difference]: With dead ends: 933 [2021-10-13 00:27:13,672 INFO L226 Difference]: Without dead ends: 915 [2021-10-13 00:27:13,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-13 00:27:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2021-10-13 00:27:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.353135313531353) internal successors, (1230), 914 states have internal predecessors, (1230), 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-13 00:27:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1230 transitions. [2021-10-13 00:27:13,746 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1230 transitions. Word has length 34 [2021-10-13 00:27:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:13,747 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1230 transitions. [2021-10-13 00:27:13,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-13 00:27:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1230 transitions. [2021-10-13 00:27:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:27:13,749 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:13,750 INFO L512 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] [2021-10-13 00:27:13,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:27:13,750 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 732400922, now seen corresponding path program 1 times [2021-10-13 00:27:13,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:13,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456860444] [2021-10-13 00:27:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:13,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:13,773 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-13 00:27:13,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:13,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456860444] [2021-10-13 00:27:13,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456860444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:13,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:13,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:13,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335152626] [2021-10-13 00:27:13,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:13,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:13,776 INFO L87 Difference]: Start difference. First operand 915 states and 1230 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 00:27:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:13,862 INFO L93 Difference]: Finished difference Result 967 states and 1286 transitions. [2021-10-13 00:27:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-10-13 00:27:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:13,865 INFO L225 Difference]: With dead ends: 967 [2021-10-13 00:27:13,866 INFO L226 Difference]: Without dead ends: 933 [2021-10-13 00:27:13,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2021-10-13 00:27:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 915. [2021-10-13 00:27:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.352035203520352) internal successors, (1229), 914 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-13 00:27:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1229 transitions. [2021-10-13 00:27:13,941 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1229 transitions. Word has length 34 [2021-10-13 00:27:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:13,941 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1229 transitions. [2021-10-13 00:27:13,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 00:27:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1229 transitions. [2021-10-13 00:27:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:27:13,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:13,944 INFO L512 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] [2021-10-13 00:27:13,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:27:13,945 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash 908827288, now seen corresponding path program 1 times [2021-10-13 00:27:13,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:13,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253475782] [2021-10-13 00:27:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:13,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:14,005 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-13 00:27:14,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:14,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253475782] [2021-10-13 00:27:14,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253475782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:14,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:14,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:14,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316259991] [2021-10-13 00:27:14,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:14,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:14,008 INFO L87 Difference]: Start difference. First operand 915 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 00:27:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:14,186 INFO L93 Difference]: Finished difference Result 1074 states and 1434 transitions. [2021-10-13 00:27:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2021-10-13 00:27:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:14,190 INFO L225 Difference]: With dead ends: 1074 [2021-10-13 00:27:14,190 INFO L226 Difference]: Without dead ends: 1053 [2021-10-13 00:27:14,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-10-13 00:27:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 915. [2021-10-13 00:27:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.350935093509351) internal successors, (1228), 914 states have internal predecessors, (1228), 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-13 00:27:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1228 transitions. [2021-10-13 00:27:14,261 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1228 transitions. Word has length 35 [2021-10-13 00:27:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:14,261 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1228 transitions. [2021-10-13 00:27:14,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-13 00:27:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1228 transitions. [2021-10-13 00:27:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:27:14,264 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:14,264 INFO L512 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] [2021-10-13 00:27:14,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:27:14,265 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash 479003308, now seen corresponding path program 1 times [2021-10-13 00:27:14,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:14,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480765487] [2021-10-13 00:27:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:14,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:14,338 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-13 00:27:14,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:14,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480765487] [2021-10-13 00:27:14,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480765487] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:14,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:14,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:27:14,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20044921] [2021-10-13 00:27:14,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:27:14,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:14,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:27:14,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:27:14,341 INFO L87 Difference]: Start difference. First operand 915 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-13 00:27:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:14,698 INFO L93 Difference]: Finished difference Result 946 states and 1258 transitions. [2021-10-13 00:27:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:27:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 35 [2021-10-13 00:27:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:14,708 INFO L225 Difference]: With dead ends: 946 [2021-10-13 00:27:14,709 INFO L226 Difference]: Without dead ends: 917 [2021-10-13 00:27:14,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.1ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:27:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-13 00:27:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 899. [2021-10-13 00:27:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 893 states have (on average 1.3527435610302352) internal successors, (1208), 898 states have internal predecessors, (1208), 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-13 00:27:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1208 transitions. [2021-10-13 00:27:14,780 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1208 transitions. Word has length 35 [2021-10-13 00:27:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:14,780 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1208 transitions. [2021-10-13 00:27:14,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-13 00:27:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1208 transitions. [2021-10-13 00:27:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:27:14,783 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:14,783 INFO L512 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] [2021-10-13 00:27:14,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 00:27:14,784 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash 290487121, now seen corresponding path program 1 times [2021-10-13 00:27:14,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:14,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363989943] [2021-10-13 00:27:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:14,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:14,841 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-13 00:27:14,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:14,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363989943] [2021-10-13 00:27:14,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363989943] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:14,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:14,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:27:14,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638540385] [2021-10-13 00:27:14,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:27:14,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:27:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:27:14,843 INFO L87 Difference]: Start difference. First operand 899 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-13 00:27:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:15,052 INFO L93 Difference]: Finished difference Result 915 states and 1224 transitions. [2021-10-13 00:27:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:27:15,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2021-10-13 00:27:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:15,056 INFO L225 Difference]: With dead ends: 915 [2021-10-13 00:27:15,056 INFO L226 Difference]: Without dead ends: 884 [2021-10-13 00:27:15,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.4ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:27:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-13 00:27:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2021-10-13 00:27:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 878 states have (on average 1.3519362186788155) internal successors, (1187), 883 states have internal predecessors, (1187), 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-13 00:27:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1187 transitions. [2021-10-13 00:27:15,141 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1187 transitions. Word has length 36 [2021-10-13 00:27:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:15,142 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 1187 transitions. [2021-10-13 00:27:15,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-13 00:27:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1187 transitions. [2021-10-13 00:27:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:27:15,145 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:15,145 INFO L512 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] [2021-10-13 00:27:15,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 00:27:15,146 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2146304349, now seen corresponding path program 1 times [2021-10-13 00:27:15,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:15,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132792675] [2021-10-13 00:27:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:15,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:15,201 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-13 00:27:15,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:15,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132792675] [2021-10-13 00:27:15,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132792675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:15,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:15,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:27:15,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575865388] [2021-10-13 00:27:15,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:27:15,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:27:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:15,204 INFO L87 Difference]: Start difference. First operand 884 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-13 00:27:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:15,387 INFO L93 Difference]: Finished difference Result 900 states and 1203 transitions. [2021-10-13 00:27:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:15,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 36 [2021-10-13 00:27:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:15,389 INFO L225 Difference]: With dead ends: 900 [2021-10-13 00:27:15,390 INFO L226 Difference]: Without dead ends: 872 [2021-10-13 00:27:15,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-10-13 00:27:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2021-10-13 00:27:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 866 states have (on average 1.3498845265588915) internal successors, (1169), 871 states have internal predecessors, (1169), 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-13 00:27:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1169 transitions. [2021-10-13 00:27:15,457 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1169 transitions. Word has length 36 [2021-10-13 00:27:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:15,457 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1169 transitions. [2021-10-13 00:27:15,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-13 00:27:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1169 transitions. [2021-10-13 00:27:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:27:15,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:15,460 INFO L512 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] [2021-10-13 00:27:15,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 00:27:15,461 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:15,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash -700544509, now seen corresponding path program 1 times [2021-10-13 00:27:15,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:15,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024081702] [2021-10-13 00:27:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:15,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:15,579 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-13 00:27:15,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:15,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024081702] [2021-10-13 00:27:15,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024081702] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:15,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:15,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:27:15,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382635911] [2021-10-13 00:27:15,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:15,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:15,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:15,581 INFO L87 Difference]: Start difference. First operand 872 states and 1169 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-13 00:27:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:16,035 INFO L93 Difference]: Finished difference Result 903 states and 1199 transitions. [2021-10-13 00:27:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:27:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 36 [2021-10-13 00:27:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:16,038 INFO L225 Difference]: With dead ends: 903 [2021-10-13 00:27:16,039 INFO L226 Difference]: Without dead ends: 874 [2021-10-13 00:27:16,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 173.6ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:27:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-13 00:27:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 856. [2021-10-13 00:27:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 850 states have (on average 1.351764705882353) internal successors, (1149), 855 states have internal predecessors, (1149), 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-13 00:27:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1149 transitions. [2021-10-13 00:27:16,133 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1149 transitions. Word has length 36 [2021-10-13 00:27:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:16,133 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1149 transitions. [2021-10-13 00:27:16,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-13 00:27:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1149 transitions. [2021-10-13 00:27:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 00:27:16,137 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:16,137 INFO L512 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] [2021-10-13 00:27:16,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 00:27:16,138 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1075516100, now seen corresponding path program 1 times [2021-10-13 00:27:16,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:16,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913864282] [2021-10-13 00:27:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:16,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:16,160 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-13 00:27:16,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:16,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913864282] [2021-10-13 00:27:16,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913864282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:16,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:16,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:16,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466651640] [2021-10-13 00:27:16,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:16,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:16,163 INFO L87 Difference]: Start difference. First operand 856 states and 1149 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 00:27:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:16,267 INFO L93 Difference]: Finished difference Result 1052 states and 1409 transitions. [2021-10-13 00:27:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2021-10-13 00:27:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:16,270 INFO L225 Difference]: With dead ends: 1052 [2021-10-13 00:27:16,270 INFO L226 Difference]: Without dead ends: 716 [2021-10-13 00:27:16,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-13 00:27:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 666. [2021-10-13 00:27:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 660 states have (on average 1.343939393939394) internal successors, (887), 665 states have internal predecessors, (887), 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-13 00:27:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 887 transitions. [2021-10-13 00:27:16,321 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 887 transitions. Word has length 37 [2021-10-13 00:27:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:16,321 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 887 transitions. [2021-10-13 00:27:16,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 00:27:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 887 transitions. [2021-10-13 00:27:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 00:27:16,323 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:16,324 INFO L512 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] [2021-10-13 00:27:16,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 00:27:16,324 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1405976500, now seen corresponding path program 1 times [2021-10-13 00:27:16,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:16,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952539887] [2021-10-13 00:27:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:16,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:16,435 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-13 00:27:16,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:16,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952539887] [2021-10-13 00:27:16,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952539887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:16,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:16,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:27:16,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954443886] [2021-10-13 00:27:16,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:16,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:16,438 INFO L87 Difference]: Start difference. First operand 666 states and 887 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-13 00:27:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:16,946 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2021-10-13 00:27:16,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 00:27:16,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-13 00:27:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:16,949 INFO L225 Difference]: With dead ends: 700 [2021-10-13 00:27:16,949 INFO L226 Difference]: Without dead ends: 668 [2021-10-13 00:27:16,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 258.4ms TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:27:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-13 00:27:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 647. [2021-10-13 00:27:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 641 states have (on average 1.3416536661466458) internal successors, (860), 646 states have internal predecessors, (860), 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-13 00:27:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 860 transitions. [2021-10-13 00:27:17,005 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 860 transitions. Word has length 37 [2021-10-13 00:27:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:17,006 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 860 transitions. [2021-10-13 00:27:17,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-13 00:27:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 860 transitions. [2021-10-13 00:27:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:27:17,008 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:17,009 INFO L512 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] [2021-10-13 00:27:17,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 00:27:17,009 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1404147991, now seen corresponding path program 1 times [2021-10-13 00:27:17,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:17,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471336229] [2021-10-13 00:27:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:17,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:17,066 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-13 00:27:17,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:17,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471336229] [2021-10-13 00:27:17,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471336229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:17,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:17,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:27:17,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939163960] [2021-10-13 00:27:17,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:27:17,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:17,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:27:17,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:17,069 INFO L87 Difference]: Start difference. First operand 647 states and 860 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-13 00:27:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:17,254 INFO L93 Difference]: Finished difference Result 672 states and 889 transitions. [2021-10-13 00:27:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:17,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2021-10-13 00:27:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:17,257 INFO L225 Difference]: With dead ends: 672 [2021-10-13 00:27:17,257 INFO L226 Difference]: Without dead ends: 639 [2021-10-13 00:27:17,258 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-13 00:27:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2021-10-13 00:27:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 633 states have (on average 1.3364928909952607) internal successors, (846), 638 states have internal predecessors, (846), 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-13 00:27:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2021-10-13 00:27:17,309 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 38 [2021-10-13 00:27:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:17,310 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2021-10-13 00:27:17,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-13 00:27:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2021-10-13 00:27:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:27:17,312 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:17,312 INFO L512 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] [2021-10-13 00:27:17,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 00:27:17,313 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1025315248, now seen corresponding path program 1 times [2021-10-13 00:27:17,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:17,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991971511] [2021-10-13 00:27:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:17,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:17,335 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-13 00:27:17,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:17,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991971511] [2021-10-13 00:27:17,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991971511] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:17,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:17,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:17,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397631510] [2021-10-13 00:27:17,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:17,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:17,338 INFO L87 Difference]: Start difference. First operand 639 states and 846 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 00:27:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:17,418 INFO L93 Difference]: Finished difference Result 691 states and 908 transitions. [2021-10-13 00:27:17,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-10-13 00:27:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:17,421 INFO L225 Difference]: With dead ends: 691 [2021-10-13 00:27:17,421 INFO L226 Difference]: Without dead ends: 649 [2021-10-13 00:27:17,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-10-13 00:27:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 636. [2021-10-13 00:27:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 630 states have (on average 1.3349206349206348) internal successors, (841), 635 states have internal predecessors, (841), 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-13 00:27:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 841 transitions. [2021-10-13 00:27:17,475 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 841 transitions. Word has length 38 [2021-10-13 00:27:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:17,476 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 841 transitions. [2021-10-13 00:27:17,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 00:27:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 841 transitions. [2021-10-13 00:27:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 00:27:17,478 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:17,478 INFO L512 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] [2021-10-13 00:27:17,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 00:27:17,479 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2131208369, now seen corresponding path program 1 times [2021-10-13 00:27:17,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:17,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975620850] [2021-10-13 00:27:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:17,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:17,516 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-13 00:27:17,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:17,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975620850] [2021-10-13 00:27:17,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975620850] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:17,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:17,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:17,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137462634] [2021-10-13 00:27:17,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:17,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:17,519 INFO L87 Difference]: Start difference. First operand 636 states and 841 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 00:27:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:17,683 INFO L93 Difference]: Finished difference Result 730 states and 951 transitions. [2021-10-13 00:27:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:27:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2021-10-13 00:27:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:17,685 INFO L225 Difference]: With dead ends: 730 [2021-10-13 00:27:17,685 INFO L226 Difference]: Without dead ends: 688 [2021-10-13 00:27:17,686 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-13 00:27:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 626. [2021-10-13 00:27:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 620 states have (on average 1.3258064516129033) internal successors, (822), 625 states have internal predecessors, (822), 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-13 00:27:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2021-10-13 00:27:17,742 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 39 [2021-10-13 00:27:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:17,742 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2021-10-13 00:27:17,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 00:27:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2021-10-13 00:27:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 00:27:17,745 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:17,745 INFO L512 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] [2021-10-13 00:27:17,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 00:27:17,745 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1912353651, now seen corresponding path program 1 times [2021-10-13 00:27:17,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:17,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956775205] [2021-10-13 00:27:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:17,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:17,788 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-13 00:27:17,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:17,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956775205] [2021-10-13 00:27:17,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956775205] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:17,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:17,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:27:17,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908299701] [2021-10-13 00:27:17,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:27:17,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:27:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:17,791 INFO L87 Difference]: Start difference. First operand 626 states and 822 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-13 00:27:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:17,901 INFO L93 Difference]: Finished difference Result 713 states and 913 transitions. [2021-10-13 00:27:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:27:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2021-10-13 00:27:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:17,903 INFO L225 Difference]: With dead ends: 713 [2021-10-13 00:27:17,903 INFO L226 Difference]: Without dead ends: 693 [2021-10-13 00:27:17,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-10-13 00:27:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 633. [2021-10-13 00:27:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 627 states have (on average 1.3221690590111643) internal successors, (829), 632 states have internal predecessors, (829), 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-13 00:27:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 829 transitions. [2021-10-13 00:27:17,958 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 829 transitions. Word has length 39 [2021-10-13 00:27:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:17,958 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 829 transitions. [2021-10-13 00:27:17,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-13 00:27:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 829 transitions. [2021-10-13 00:27:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 00:27:17,960 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:17,961 INFO L512 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] [2021-10-13 00:27:17,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 00:27:17,961 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1059382494, now seen corresponding path program 1 times [2021-10-13 00:27:17,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:17,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578081682] [2021-10-13 00:27:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:17,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:18,064 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-13 00:27:18,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:18,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578081682] [2021-10-13 00:27:18,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578081682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:18,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:18,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:27:18,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484616243] [2021-10-13 00:27:18,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:27:18,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:18,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:27:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:18,067 INFO L87 Difference]: Start difference. First operand 633 states and 829 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-13 00:27:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:18,246 INFO L93 Difference]: Finished difference Result 766 states and 1000 transitions. [2021-10-13 00:27:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:27:18,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2021-10-13 00:27:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:18,249 INFO L225 Difference]: With dead ends: 766 [2021-10-13 00:27:18,249 INFO L226 Difference]: Without dead ends: 632 [2021-10-13 00:27:18,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-13 00:27:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2021-10-13 00:27:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 613 states have (on average 1.3164763458401305) internal successors, (807), 618 states have internal predecessors, (807), 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-13 00:27:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 807 transitions. [2021-10-13 00:27:18,346 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 807 transitions. Word has length 39 [2021-10-13 00:27:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:18,346 INFO L470 AbstractCegarLoop]: Abstraction has 619 states and 807 transitions. [2021-10-13 00:27:18,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-13 00:27:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 807 transitions. [2021-10-13 00:27:18,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:27:18,348 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:18,348 INFO L512 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] [2021-10-13 00:27:18,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 00:27:18,349 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:18,349 INFO L82 PathProgramCache]: Analyzing trace with hash -494516766, now seen corresponding path program 1 times [2021-10-13 00:27:18,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:18,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112196314] [2021-10-13 00:27:18,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:18,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:18,408 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-13 00:27:18,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:18,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112196314] [2021-10-13 00:27:18,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112196314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:18,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:18,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:27:18,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899341291] [2021-10-13 00:27:18,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:27:18,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:27:18,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:27:18,410 INFO L87 Difference]: Start difference. First operand 619 states and 807 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-13 00:27:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:18,601 INFO L93 Difference]: Finished difference Result 640 states and 829 transitions. [2021-10-13 00:27:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:27:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 40 [2021-10-13 00:27:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:18,604 INFO L225 Difference]: With dead ends: 640 [2021-10-13 00:27:18,604 INFO L226 Difference]: Without dead ends: 532 [2021-10-13 00:27:18,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:27:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-13 00:27:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-13 00:27:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.3193916349809887) internal successors, (694), 531 states have internal predecessors, (694), 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-13 00:27:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 694 transitions. [2021-10-13 00:27:18,657 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 694 transitions. Word has length 40 [2021-10-13 00:27:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:18,657 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 694 transitions. [2021-10-13 00:27:18,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-13 00:27:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 694 transitions. [2021-10-13 00:27:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 00:27:18,659 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:18,659 INFO L512 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] [2021-10-13 00:27:18,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 00:27:18,660 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1734827187, now seen corresponding path program 1 times [2021-10-13 00:27:18,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:18,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570029492] [2021-10-13 00:27:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:18,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:18,702 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-13 00:27:18,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:18,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570029492] [2021-10-13 00:27:18,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570029492] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:18,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:18,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:18,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853097726] [2021-10-13 00:27:18,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:18,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:18,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:18,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:18,705 INFO L87 Difference]: Start difference. First operand 532 states and 694 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 00:27:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:18,871 INFO L93 Difference]: Finished difference Result 705 states and 915 transitions. [2021-10-13 00:27:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2021-10-13 00:27:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:18,873 INFO L225 Difference]: With dead ends: 705 [2021-10-13 00:27:18,874 INFO L226 Difference]: Without dead ends: 550 [2021-10-13 00:27:18,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-13 00:27:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2021-10-13 00:27:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.311787072243346) internal successors, (690), 531 states have internal predecessors, (690), 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-13 00:27:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 690 transitions. [2021-10-13 00:27:18,928 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 690 transitions. Word has length 40 [2021-10-13 00:27:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:18,929 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 690 transitions. [2021-10-13 00:27:18,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 00:27:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 690 transitions. [2021-10-13 00:27:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 00:27:18,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:18,931 INFO L512 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] [2021-10-13 00:27:18,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 00:27:18,931 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash 289296501, now seen corresponding path program 1 times [2021-10-13 00:27:18,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:18,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269046763] [2021-10-13 00:27:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:18,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:19,016 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-13 00:27:19,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:19,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269046763] [2021-10-13 00:27:19,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269046763] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:19,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:19,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 00:27:19,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58571085] [2021-10-13 00:27:19,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 00:27:19,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:27:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:27:19,018 INFO L87 Difference]: Start difference. First operand 532 states and 690 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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-13 00:27:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:19,313 INFO L93 Difference]: Finished difference Result 624 states and 800 transitions. [2021-10-13 00:27:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:27:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 41 [2021-10-13 00:27:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:19,315 INFO L225 Difference]: With dead ends: 624 [2021-10-13 00:27:19,315 INFO L226 Difference]: Without dead ends: 479 [2021-10-13 00:27:19,316 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 122.0ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-13 00:27:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-13 00:27:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 432. [2021-10-13 00:27:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 426 states have (on average 1.2863849765258215) internal successors, (548), 431 states have internal predecessors, (548), 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-13 00:27:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 548 transitions. [2021-10-13 00:27:19,371 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 548 transitions. Word has length 41 [2021-10-13 00:27:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:19,372 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 548 transitions. [2021-10-13 00:27:19,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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-13 00:27:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 548 transitions. [2021-10-13 00:27:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 00:27:19,374 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:19,374 INFO L512 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] [2021-10-13 00:27:19,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 00:27:19,374 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:19,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1488645827, now seen corresponding path program 1 times [2021-10-13 00:27:19,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:19,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635496299] [2021-10-13 00:27:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:19,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:19,401 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-13 00:27:19,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:19,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635496299] [2021-10-13 00:27:19,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635496299] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:19,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:19,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:19,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112163168] [2021-10-13 00:27:19,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:19,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:19,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:19,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:19,404 INFO L87 Difference]: Start difference. First operand 432 states and 548 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 00:27:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:19,561 INFO L93 Difference]: Finished difference Result 481 states and 603 transitions. [2021-10-13 00:27:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:19,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2021-10-13 00:27:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:19,563 INFO L225 Difference]: With dead ends: 481 [2021-10-13 00:27:19,564 INFO L226 Difference]: Without dead ends: 468 [2021-10-13 00:27:19,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-10-13 00:27:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 458. [2021-10-13 00:27:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 452 states have (on average 1.2809734513274336) internal successors, (579), 457 states have internal predecessors, (579), 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-13 00:27:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 579 transitions. [2021-10-13 00:27:19,623 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 579 transitions. Word has length 41 [2021-10-13 00:27:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:19,624 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 579 transitions. [2021-10-13 00:27:19,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-13 00:27:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 579 transitions. [2021-10-13 00:27:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-13 00:27:19,626 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:19,626 INFO L512 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] [2021-10-13 00:27:19,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-13 00:27:19,627 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1202346494, now seen corresponding path program 1 times [2021-10-13 00:27:19,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:19,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051224040] [2021-10-13 00:27:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:19,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:19,655 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-13 00:27:19,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:19,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051224040] [2021-10-13 00:27:19,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051224040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:19,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:19,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:19,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730089690] [2021-10-13 00:27:19,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:19,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:19,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:19,658 INFO L87 Difference]: Start difference. First operand 458 states and 579 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 00:27:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:19,730 INFO L93 Difference]: Finished difference Result 484 states and 608 transitions. [2021-10-13 00:27:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2021-10-13 00:27:19,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:19,732 INFO L225 Difference]: With dead ends: 484 [2021-10-13 00:27:19,732 INFO L226 Difference]: Without dead ends: 453 [2021-10-13 00:27:19,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-13 00:27:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2021-10-13 00:27:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 444 states have (on average 1.2702702702702702) internal successors, (564), 449 states have internal predecessors, (564), 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-13 00:27:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 564 transitions. [2021-10-13 00:27:19,788 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 564 transitions. Word has length 42 [2021-10-13 00:27:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:19,789 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 564 transitions. [2021-10-13 00:27:19,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 00:27:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 564 transitions. [2021-10-13 00:27:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-13 00:27:19,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:19,791 INFO L512 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] [2021-10-13 00:27:19,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-13 00:27:19,791 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1198792050, now seen corresponding path program 1 times [2021-10-13 00:27:19,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:19,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268761502] [2021-10-13 00:27:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:19,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:19,822 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-13 00:27:19,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:19,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268761502] [2021-10-13 00:27:19,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268761502] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:19,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:19,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:19,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985065517] [2021-10-13 00:27:19,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:19,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:19,825 INFO L87 Difference]: Start difference. First operand 450 states and 564 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 00:27:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:19,958 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-10-13 00:27:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:19,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2021-10-13 00:27:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:19,960 INFO L225 Difference]: With dead ends: 535 [2021-10-13 00:27:19,960 INFO L226 Difference]: Without dead ends: 394 [2021-10-13 00:27:19,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-13 00:27:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 374. [2021-10-13 00:27:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.2405405405405405) internal successors, (459), 373 states have internal predecessors, (459), 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-13 00:27:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 459 transitions. [2021-10-13 00:27:20,011 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 459 transitions. Word has length 42 [2021-10-13 00:27:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:20,011 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 459 transitions. [2021-10-13 00:27:20,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 00:27:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 459 transitions. [2021-10-13 00:27:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 00:27:20,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:20,013 INFO L512 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] [2021-10-13 00:27:20,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-13 00:27:20,014 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 888562187, now seen corresponding path program 1 times [2021-10-13 00:27:20,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:20,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595782183] [2021-10-13 00:27:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:20,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:20,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-13 00:27:20,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:20,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595782183] [2021-10-13 00:27:20,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595782183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:20,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:20,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:27:20,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701827177] [2021-10-13 00:27:20,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:27:20,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:27:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:27:20,088 INFO L87 Difference]: Start difference. First operand 374 states and 459 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-13 00:27:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:20,258 INFO L93 Difference]: Finished difference Result 417 states and 508 transitions. [2021-10-13 00:27:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:27:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 43 [2021-10-13 00:27:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:20,259 INFO L225 Difference]: With dead ends: 417 [2021-10-13 00:27:20,259 INFO L226 Difference]: Without dead ends: 392 [2021-10-13 00:27:20,259 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 78.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:27:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-10-13 00:27:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2021-10-13 00:27:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 361 states have internal predecessors, (445), 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-13 00:27:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 445 transitions. [2021-10-13 00:27:20,306 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 445 transitions. Word has length 43 [2021-10-13 00:27:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:20,307 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 445 transitions. [2021-10-13 00:27:20,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-13 00:27:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 445 transitions. [2021-10-13 00:27:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 00:27:20,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:20,309 INFO L512 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] [2021-10-13 00:27:20,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-13 00:27:20,309 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:20,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash -352812212, now seen corresponding path program 1 times [2021-10-13 00:27:20,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:20,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033040127] [2021-10-13 00:27:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:20,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:20,360 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-13 00:27:20,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:20,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033040127] [2021-10-13 00:27:20,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033040127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:20,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:20,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:20,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690220432] [2021-10-13 00:27:20,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:20,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:20,363 INFO L87 Difference]: Start difference. First operand 362 states and 445 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 00:27:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:20,515 INFO L93 Difference]: Finished difference Result 367 states and 449 transitions. [2021-10-13 00:27:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2021-10-13 00:27:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:20,517 INFO L225 Difference]: With dead ends: 367 [2021-10-13 00:27:20,517 INFO L226 Difference]: Without dead ends: 343 [2021-10-13 00:27:20,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-10-13 00:27:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-10-13 00:27:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 339 states have (on average 1.238938053097345) internal successors, (420), 342 states have internal predecessors, (420), 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-13 00:27:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2021-10-13 00:27:20,603 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 43 [2021-10-13 00:27:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:20,603 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2021-10-13 00:27:20,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 00:27:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2021-10-13 00:27:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-13 00:27:20,605 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:20,605 INFO L512 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-13 00:27:20,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-13 00:27:20,606 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1424724662, now seen corresponding path program 1 times [2021-10-13 00:27:20,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:20,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819105561] [2021-10-13 00:27:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:20,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:20,742 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-13 00:27:20,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:20,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819105561] [2021-10-13 00:27:20,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819105561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:20,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:20,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:27:20,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911045498] [2021-10-13 00:27:20,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:20,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:20,745 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 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-13 00:27:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:21,109 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2021-10-13 00:27:21,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:27:21,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 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-13 00:27:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:21,111 INFO L225 Difference]: With dead ends: 356 [2021-10-13 00:27:21,111 INFO L226 Difference]: Without dead ends: 298 [2021-10-13 00:27:21,112 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 128.3ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:27:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-13 00:27:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-10-13 00:27:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 294 states have (on average 1.2312925170068028) internal successors, (362), 297 states have internal predecessors, (362), 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-13 00:27:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 362 transitions. [2021-10-13 00:27:21,167 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 362 transitions. Word has length 44 [2021-10-13 00:27:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:21,167 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 362 transitions. [2021-10-13 00:27:21,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 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-13 00:27:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 362 transitions. [2021-10-13 00:27:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-13 00:27:21,170 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:21,170 INFO L512 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-13 00:27:21,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-13 00:27:21,171 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:21,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1904668637, now seen corresponding path program 1 times [2021-10-13 00:27:21,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:21,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597441314] [2021-10-13 00:27:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:21,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:21,255 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-13 00:27:21,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:21,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597441314] [2021-10-13 00:27:21,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597441314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:21,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:21,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:27:21,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100356074] [2021-10-13 00:27:21,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:27:21,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:21,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:27:21,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:27:21,258 INFO L87 Difference]: Start difference. First operand 298 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-13 00:27:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:21,452 INFO L93 Difference]: Finished difference Result 628 states and 758 transitions. [2021-10-13 00:27:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:27:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-13 00:27:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:21,454 INFO L225 Difference]: With dead ends: 628 [2021-10-13 00:27:21,454 INFO L226 Difference]: Without dead ends: 558 [2021-10-13 00:27:21,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-13 00:27:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-13 00:27:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 315 states have internal predecessors, (382), 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-13 00:27:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2021-10-13 00:27:21,506 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 44 [2021-10-13 00:27:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:21,507 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2021-10-13 00:27:21,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-13 00:27:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2021-10-13 00:27:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-13 00:27:21,508 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:21,508 INFO L512 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-13 00:27:21,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-13 00:27:21,509 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1732054660, now seen corresponding path program 1 times [2021-10-13 00:27:21,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:21,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719600903] [2021-10-13 00:27:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:21,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:21,546 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-13 00:27:21,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:21,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719600903] [2021-10-13 00:27:21,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719600903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:21,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:21,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:27:21,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102457353] [2021-10-13 00:27:21,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:27:21,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:21,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:27:21,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:27:21,549 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-13 00:27:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:21,682 INFO L93 Difference]: Finished difference Result 320 states and 385 transitions. [2021-10-13 00:27:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:27:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-13 00:27:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:21,684 INFO L225 Difference]: With dead ends: 320 [2021-10-13 00:27:21,684 INFO L226 Difference]: Without dead ends: 316 [2021-10-13 00:27:21,685 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:27:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-13 00:27:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-10-13 00:27:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2211538461538463) internal successors, (381), 315 states have internal predecessors, (381), 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-13 00:27:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 381 transitions. [2021-10-13 00:27:21,736 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 381 transitions. Word has length 44 [2021-10-13 00:27:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:21,736 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 381 transitions. [2021-10-13 00:27:21,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-13 00:27:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 381 transitions. [2021-10-13 00:27:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-13 00:27:21,738 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:21,738 INFO L512 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-13 00:27:21,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-13 00:27:21,738 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:21,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1966651937, now seen corresponding path program 1 times [2021-10-13 00:27:21,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:21,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896880419] [2021-10-13 00:27:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:21,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:21,767 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-13 00:27:21,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:21,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896880419] [2021-10-13 00:27:21,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896880419] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:21,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:21,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:27:21,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195441714] [2021-10-13 00:27:21,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:27:21,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:21,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:27:21,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:21,769 INFO L87 Difference]: Start difference. First operand 316 states and 381 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-13 00:27:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:21,877 INFO L93 Difference]: Finished difference Result 621 states and 743 transitions. [2021-10-13 00:27:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:27:21,878 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-13 00:27:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:21,880 INFO L225 Difference]: With dead ends: 621 [2021-10-13 00:27:21,880 INFO L226 Difference]: Without dead ends: 558 [2021-10-13 00:27:21,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:27:21,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-13 00:27:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-13 00:27:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2147435897435896) internal successors, (379), 315 states have internal predecessors, (379), 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-13 00:27:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 379 transitions. [2021-10-13 00:27:21,920 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 379 transitions. Word has length 44 [2021-10-13 00:27:21,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:21,920 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 379 transitions. [2021-10-13 00:27:21,921 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-13 00:27:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 379 transitions. [2021-10-13 00:27:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:27:21,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:21,922 INFO L512 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-13 00:27:21,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-13 00:27:21,922 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:21,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2123245657, now seen corresponding path program 1 times [2021-10-13 00:27:21,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:21,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398596986] [2021-10-13 00:27:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:21,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:22,002 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-13 00:27:22,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:22,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398596986] [2021-10-13 00:27:22,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398596986] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:22,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:22,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:27:22,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002297144] [2021-10-13 00:27:22,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:27:22,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:27:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:27:22,005 INFO L87 Difference]: Start difference. First operand 316 states and 379 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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-13 00:27:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:22,369 INFO L93 Difference]: Finished difference Result 535 states and 638 transitions. [2021-10-13 00:27:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:27:22,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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-13 00:27:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:22,371 INFO L225 Difference]: With dead ends: 535 [2021-10-13 00:27:22,371 INFO L226 Difference]: Without dead ends: 429 [2021-10-13 00:27:22,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 125.4ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:27:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-13 00:27:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 324. [2021-10-13 00:27:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 320 states have (on average 1.203125) internal successors, (385), 323 states have internal predecessors, (385), 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-13 00:27:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 385 transitions. [2021-10-13 00:27:22,432 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 385 transitions. Word has length 45 [2021-10-13 00:27:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:22,432 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 385 transitions. [2021-10-13 00:27:22,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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-13 00:27:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 385 transitions. [2021-10-13 00:27:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:27:22,435 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:22,435 INFO L512 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-13 00:27:22,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-13 00:27:22,436 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -970126947, now seen corresponding path program 1 times [2021-10-13 00:27:22,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:22,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454294682] [2021-10-13 00:27:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:22,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:22,503 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-13 00:27:22,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:22,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454294682] [2021-10-13 00:27:22,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454294682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:22,504 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:22,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:27:22,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75326558] [2021-10-13 00:27:22,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:27:22,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:27:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:27:22,506 INFO L87 Difference]: Start difference. First operand 324 states and 385 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-13 00:27:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:22,700 INFO L93 Difference]: Finished difference Result 576 states and 684 transitions. [2021-10-13 00:27:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:27:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-13 00:27:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:22,703 INFO L225 Difference]: With dead ends: 576 [2021-10-13 00:27:22,703 INFO L226 Difference]: Without dead ends: 537 [2021-10-13 00:27:22,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-10-13 00:27:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 290. [2021-10-13 00:27:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 287 states have (on average 1.1986062717770034) internal successors, (344), 289 states have internal predecessors, (344), 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-13 00:27:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 344 transitions. [2021-10-13 00:27:22,761 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 344 transitions. Word has length 45 [2021-10-13 00:27:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:22,761 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 344 transitions. [2021-10-13 00:27:22,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-13 00:27:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 344 transitions. [2021-10-13 00:27:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 00:27:22,763 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:22,763 INFO L512 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, 1, 1] [2021-10-13 00:27:22,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-13 00:27:22,763 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:22,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198740, now seen corresponding path program 1 times [2021-10-13 00:27:22,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:22,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265366799] [2021-10-13 00:27:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:22,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:27:22,875 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-13 00:27:22,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:27:22,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265366799] [2021-10-13 00:27:22,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265366799] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:27:22,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:27:22,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:27:22,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680415000] [2021-10-13 00:27:22,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:27:22,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:27:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:27:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:27:22,878 INFO L87 Difference]: Start difference. First operand 290 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-13 00:27:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:27:23,208 INFO L93 Difference]: Finished difference Result 290 states and 344 transitions. [2021-10-13 00:27:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:27:23,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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 47 [2021-10-13 00:27:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:27:23,210 INFO L225 Difference]: With dead ends: 290 [2021-10-13 00:27:23,210 INFO L226 Difference]: Without dead ends: 214 [2021-10-13 00:27:23,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 149.0ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:27:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-13 00:27:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-10-13 00:27:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.1839622641509433) internal successors, (251), 213 states have internal predecessors, (251), 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-13 00:27:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 251 transitions. [2021-10-13 00:27:23,251 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 251 transitions. Word has length 47 [2021-10-13 00:27:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:27:23,252 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 251 transitions. [2021-10-13 00:27:23,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 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-13 00:27:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2021-10-13 00:27:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 00:27:23,255 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:27:23,256 INFO L512 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, 1, 1] [2021-10-13 00:27:23,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-13 00:27:23,256 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 00:27:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:27:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1477898981, now seen corresponding path program 1 times [2021-10-13 00:27:23,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:27:23,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185438942] [2021-10-13 00:27:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:27:23,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:27:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:27:23,277 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:27:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:27:23,357 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:27:23,358 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:27:23,359 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,362 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,371 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,387 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,388 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,389 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:27:23,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-13 00:27:23,399 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:27:23,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:27:23 BoogieIcfgContainer [2021-10-13 00:27:23,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:27:23,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:27:23,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:27:23,568 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:27:23,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:27:01" (3/4) ... [2021-10-13 00:27:23,570 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:27:23,688 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:27:23,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:27:23,690 INFO L168 Benchmark]: Toolchain (without parser) took 27139.10 ms. Allocated memory was 86.0 MB in the beginning and 522.2 MB in the end (delta: 436.2 MB). Free memory was 47.7 MB in the beginning and 237.4 MB in the end (delta: -189.7 MB). Peak memory consumption was 246.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,690 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 86.0 MB. Free memory was 66.2 MB in the beginning and 66.2 MB in the end (delta: 27.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:27:23,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 986.96 ms. Allocated memory was 86.0 MB in the beginning and 107.0 MB in the end (delta: 21.0 MB). Free memory was 47.5 MB in the beginning and 64.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 313.21 ms. Allocated memory is still 107.0 MB. Free memory was 64.0 MB in the beginning and 75.8 MB in the end (delta: -11.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,692 INFO L168 Benchmark]: Boogie Preprocessor took 291.09 ms. Allocated memory is still 107.0 MB. Free memory was 75.8 MB in the beginning and 65.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,693 INFO L168 Benchmark]: RCFGBuilder took 3148.85 ms. Allocated memory was 107.0 MB in the beginning and 159.4 MB in the end (delta: 52.4 MB). Free memory was 64.9 MB in the beginning and 99.2 MB in the end (delta: -34.3 MB). Peak memory consumption was 52.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,693 INFO L168 Benchmark]: TraceAbstraction took 22262.24 ms. Allocated memory was 159.4 MB in the beginning and 522.2 MB in the end (delta: 362.8 MB). Free memory was 99.2 MB in the beginning and 250.0 MB in the end (delta: -150.7 MB). Peak memory consumption was 212.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,694 INFO L168 Benchmark]: Witness Printer took 121.15 ms. Allocated memory is still 522.2 MB. Free memory was 250.0 MB in the beginning and 237.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:27:23,697 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.29 ms. Allocated memory is still 86.0 MB. Free memory was 66.2 MB in the beginning and 66.2 MB in the end (delta: 27.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 986.96 ms. Allocated memory was 86.0 MB in the beginning and 107.0 MB in the end (delta: 21.0 MB). Free memory was 47.5 MB in the beginning and 64.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 313.21 ms. Allocated memory is still 107.0 MB. Free memory was 64.0 MB in the beginning and 75.8 MB in the end (delta: -11.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 291.09 ms. Allocated memory is still 107.0 MB. Free memory was 75.8 MB in the beginning and 65.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3148.85 ms. Allocated memory was 107.0 MB in the beginning and 159.4 MB in the end (delta: 52.4 MB). Free memory was 64.9 MB in the beginning and 99.2 MB in the end (delta: -34.3 MB). Peak memory consumption was 52.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22262.24 ms. Allocated memory was 159.4 MB in the beginning and 522.2 MB in the end (delta: 362.8 MB). Free memory was 99.2 MB in the beginning and 250.0 MB in the end (delta: -150.7 MB). Peak memory consumption was 212.9 MB. Max. memory is 16.1 GB. * Witness Printer took 121.15 ms. Allocated memory is still 522.2 MB. Free memory was 250.0 MB in the beginning and 237.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1944] returnVal2 = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1981] return (returnVal2); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND TRUE \read(we_should_unload) [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1185 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 22011.8ms, OverallIterations: 56, TraceHistogramMax: 1, EmptinessCheckTime: 145.3ms, AutomataDifference: 13817.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 38.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49574 SDtfs, 21547 SDslu, 110166 SDs, 0 SdLazy, 7182 SolverSat, 921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5611.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2056.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1245occurred in iteration=4, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3830.3ms AutomataMinimizationTime, 55 MinimizatonAttempts, 2604 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 175.3ms SsaConstructionTime, 691.7ms SatisfiabilityAnalysisTime, 2493.6ms InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1795 ConstructedInterpolants, 0 QuantifiedInterpolants, 4918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 55 PerfectInterpolantSequences, 0/0 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-13 00:27:23,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f307bb8d-63f6-4e43-88f1-caad8f31831f/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...