./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d91e51d094cab36c95ce71390b6f6e3b0860cf29ca1f23e180f46919f9e9f05c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:10:52,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:10:52,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:10:52,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:10:52,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:10:52,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:10:52,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:10:52,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:10:52,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:10:52,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:10:52,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:10:52,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:10:52,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:10:52,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:10:52,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:10:52,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:10:52,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:10:52,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:10:52,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:10:52,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:10:52,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:10:52,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:10:52,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:10:52,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:10:52,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:10:52,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:10:52,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:10:52,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:10:52,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:10:52,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:10:52,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:10:52,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:10:52,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:10:52,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:10:52,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:10:52,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:10:52,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:10:52,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:10:52,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:10:52,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:10:52,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:10:52,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:10:52,338 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:10:52,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:10:52,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:10:52,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:10:52,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:10:52,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:10:52,348 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:10:52,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:10:52,349 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:10:52,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:10:52,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:10:52,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:10:52,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:10:52,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:10:52,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:10:52,351 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:10:52,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:10:52,351 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:10:52,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:10:52,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:10:52,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:10:52,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:10:52,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:10:52,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:10:52,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:10:52,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:10:52,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:10:52,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:10:52,354 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:10:52,355 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:10:52,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:10:52,356 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:10:52,356 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_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d91e51d094cab36c95ce71390b6f6e3b0860cf29ca1f23e180f46919f9e9f05c [2021-10-28 23:10:52,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:10:52,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:10:52,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:10:52,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:10:52,743 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:10:52,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2021-10-28 23:10:52,836 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/data/6280acb4f/00bbc3dbefb341bb9241f48d7d0709c7/FLAG49954b765 [2021-10-28 23:10:53,445 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:10:53,446 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/sv-benchmarks/c/systemc/bist_cell.cil.c [2021-10-28 23:10:53,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/data/6280acb4f/00bbc3dbefb341bb9241f48d7d0709c7/FLAG49954b765 [2021-10-28 23:10:53,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/data/6280acb4f/00bbc3dbefb341bb9241f48d7d0709c7 [2021-10-28 23:10:53,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:10:53,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:10:53,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:10:53,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:10:53,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:10:53,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:10:53" (1/1) ... [2021-10-28 23:10:53,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57946d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:53, skipping insertion in model container [2021-10-28 23:10:53,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:10:53" (1/1) ... [2021-10-28 23:10:53,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:10:53,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:10:53,994 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_935c0914-3080-461c-8933-110724ace425/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-10-28 23:10:54,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:10:54,079 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:10:54,094 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_935c0914-3080-461c-8933-110724ace425/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] [2021-10-28 23:10:54,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:10:54,182 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:10:54,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54 WrapperNode [2021-10-28 23:10:54,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:10:54,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:10:54,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:10:54,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:10:54,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:10:54,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:10:54,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:10:54,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:10:54,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:10:54,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:10:54,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:10:54,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:10:54,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (1/1) ... [2021-10-28 23:10:54,353 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:10:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:10:54,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:10:54,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:10:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:10:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:10:54,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:10:54,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:10:55,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:10:55,097 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2021-10-28 23:10:55,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:10:55 BoogieIcfgContainer [2021-10-28 23:10:55,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:10:55,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:10:55,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:10:55,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:10:55,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:10:53" (1/3) ... [2021-10-28 23:10:55,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fc6355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:10:55, skipping insertion in model container [2021-10-28 23:10:55,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:10:54" (2/3) ... [2021-10-28 23:10:55,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fc6355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:10:55, skipping insertion in model container [2021-10-28 23:10:55,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:10:55" (3/3) ... [2021-10-28 23:10:55,123 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2021-10-28 23:10:55,129 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:10:55,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 23:10:55,242 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:10:55,276 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:10:55,277 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 23:10:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 23:10:55,312 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:55,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:55,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2021-10-28 23:10:55,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:55,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485784354] [2021-10-28 23:10:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:55,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:55,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:55,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485784354] [2021-10-28 23:10:55,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485784354] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:55,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:55,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:55,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630997752] [2021-10-28 23:10:55,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:55,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:55,564 INFO L87 Difference]: Start difference. First operand has 108 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 107 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.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-28 23:10:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:55,622 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2021-10-28 23:10:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:55,625 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-28 23:10:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:55,637 INFO L225 Difference]: With dead ends: 210 [2021-10-28 23:10:55,638 INFO L226 Difference]: Without dead ends: 104 [2021-10-28 23:10:55,641 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-28 23:10:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-28 23:10:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 103 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2021-10-28 23:10:55,694 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2021-10-28 23:10:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:55,695 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2021-10-28 23:10:55,695 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-28 23:10:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2021-10-28 23:10:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-10-28 23:10:55,699 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:55,699 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:55,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:10:55,700 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2021-10-28 23:10:55,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:55,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964483374] [2021-10-28 23:10:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:55,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:55,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:55,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964483374] [2021-10-28 23:10:55,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964483374] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:55,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:55,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:55,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541579541] [2021-10-28 23:10:55,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:55,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:55,785 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:55,831 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2021-10-28 23:10:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:55,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-10-28 23:10:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:55,839 INFO L225 Difference]: With dead ends: 199 [2021-10-28 23:10:55,839 INFO L226 Difference]: Without dead ends: 104 [2021-10-28 23:10:55,841 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-28 23:10:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-28 23:10:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 103 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2021-10-28 23:10:55,860 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2021-10-28 23:10:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:55,861 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2021-10-28 23:10:55,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2021-10-28 23:10:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-28 23:10:55,870 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:55,871 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:55,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:10:55,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2021-10-28 23:10:55,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:55,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280490031] [2021-10-28 23:10:55,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:55,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:55,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:55,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280490031] [2021-10-28 23:10:55,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280490031] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:55,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:55,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:55,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463723697] [2021-10-28 23:10:55,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:55,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:55,983 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:56,015 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2021-10-28 23:10:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-10-28 23:10:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:56,018 INFO L225 Difference]: With dead ends: 196 [2021-10-28 23:10:56,018 INFO L226 Difference]: Without dead ends: 104 [2021-10-28 23:10:56,020 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-28 23:10:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-28 23:10:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 103 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2021-10-28 23:10:56,033 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2021-10-28 23:10:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:56,034 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2021-10-28 23:10:56,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2021-10-28 23:10:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-28 23:10:56,038 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:56,038 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:56,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:10:56,039 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2021-10-28 23:10:56,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:56,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928279581] [2021-10-28 23:10:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:56,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:56,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:56,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928279581] [2021-10-28 23:10:56,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928279581] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:56,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:56,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:56,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807674760] [2021-10-28 23:10:56,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:56,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:56,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:56,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,189 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:56,214 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2021-10-28 23:10:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:56,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-10-28 23:10:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:56,216 INFO L225 Difference]: With dead ends: 193 [2021-10-28 23:10:56,217 INFO L226 Difference]: Without dead ends: 104 [2021-10-28 23:10:56,218 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-28 23:10:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-28 23:10:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6213592233009708) internal successors, (167), 103 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2021-10-28 23:10:56,230 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2021-10-28 23:10:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:56,230 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2021-10-28 23:10:56,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2021-10-28 23:10:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-28 23:10:56,234 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:56,235 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:56,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:10:56,235 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2021-10-28 23:10:56,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:56,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81042375] [2021-10-28 23:10:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:56,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:56,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-28 23:10:56,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:56,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81042375] [2021-10-28 23:10:56,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81042375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:56,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:56,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:56,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183102461] [2021-10-28 23:10:56,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:56,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:56,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,391 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:56,466 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2021-10-28 23:10:56,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:56,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-10-28 23:10:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:56,470 INFO L225 Difference]: With dead ends: 271 [2021-10-28 23:10:56,470 INFO L226 Difference]: Without dead ends: 191 [2021-10-28 23:10:56,471 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-28 23:10:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2021-10-28 23:10:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 187 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2021-10-28 23:10:56,520 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2021-10-28 23:10:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:56,521 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2021-10-28 23:10:56,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2021-10-28 23:10:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-28 23:10:56,537 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:56,538 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:56,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:10:56,538 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2021-10-28 23:10:56,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:56,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610583194] [2021-10-28 23:10:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:56,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:56,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:56,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610583194] [2021-10-28 23:10:56,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610583194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:56,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:56,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:10:56,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011861995] [2021-10-28 23:10:56,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:10:56,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:10:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:10:56,714 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:56,833 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2021-10-28 23:10:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:10:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-10-28 23:10:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:56,837 INFO L225 Difference]: With dead ends: 444 [2021-10-28 23:10:56,837 INFO L226 Difference]: Without dead ends: 261 [2021-10-28 23:10:56,839 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:10:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-28 23:10:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2021-10-28 23:10:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.6062176165803108) internal successors, (310), 193 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2021-10-28 23:10:56,861 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2021-10-28 23:10:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:56,862 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2021-10-28 23:10:56,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2021-10-28 23:10:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-28 23:10:56,866 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:56,866 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:56,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:10:56,867 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:56,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2021-10-28 23:10:56,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:56,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356243600] [2021-10-28 23:10:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:56,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:56,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:56,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356243600] [2021-10-28 23:10:56,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356243600] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:56,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:56,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:56,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139672875] [2021-10-28 23:10:56,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:56,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:56,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,922 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:56,961 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2021-10-28 23:10:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:56,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-10-28 23:10:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:56,965 INFO L225 Difference]: With dead ends: 408 [2021-10-28 23:10:56,965 INFO L226 Difference]: Without dead ends: 271 [2021-10-28 23:10:56,966 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-10-28 23:10:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2021-10-28 23:10:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2021-10-28 23:10:56,988 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2021-10-28 23:10:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:56,989 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2021-10-28 23:10:56,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2021-10-28 23:10:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-28 23:10:56,994 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:56,994 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:56,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:10:56,995 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2021-10-28 23:10:56,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:56,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228831645] [2021-10-28 23:10:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:56,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:57,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:57,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228831645] [2021-10-28 23:10:57,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228831645] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:57,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:57,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:10:57,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715406963] [2021-10-28 23:10:57,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:10:57,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:57,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:10:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:10:57,073 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:57,210 INFO L93 Difference]: Finished difference Result 749 states and 1171 transitions. [2021-10-28 23:10:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:10:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-10-28 23:10:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:57,217 INFO L225 Difference]: With dead ends: 749 [2021-10-28 23:10:57,218 INFO L226 Difference]: Without dead ends: 554 [2021-10-28 23:10:57,219 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:10:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-10-28 23:10:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 280. [2021-10-28 23:10:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 279 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2021-10-28 23:10:57,250 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2021-10-28 23:10:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:57,250 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2021-10-28 23:10:57,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2021-10-28 23:10:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-28 23:10:57,258 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:57,258 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:57,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:10:57,260 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2021-10-28 23:10:57,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:57,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989223815] [2021-10-28 23:10:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:57,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:57,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:57,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989223815] [2021-10-28 23:10:57,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989223815] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:57,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:57,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:57,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622889193] [2021-10-28 23:10:57,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:57,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:57,358 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:57,407 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2021-10-28 23:10:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-10-28 23:10:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:57,412 INFO L225 Difference]: With dead ends: 563 [2021-10-28 23:10:57,412 INFO L226 Difference]: Without dead ends: 332 [2021-10-28 23:10:57,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-28 23:10:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2021-10-28 23:10:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.5391849529780564) internal successors, (491), 319 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2021-10-28 23:10:57,458 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2021-10-28 23:10:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:57,459 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2021-10-28 23:10:57,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2021-10-28 23:10:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-28 23:10:57,462 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:57,463 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:57,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:10:57,463 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:57,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2021-10-28 23:10:57,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:57,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924593255] [2021-10-28 23:10:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:57,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:57,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:57,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924593255] [2021-10-28 23:10:57,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924593255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:57,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:57,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:57,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961893000] [2021-10-28 23:10:57,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:57,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:57,536 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:57,572 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2021-10-28 23:10:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-10-28 23:10:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:57,575 INFO L225 Difference]: With dead ends: 567 [2021-10-28 23:10:57,575 INFO L226 Difference]: Without dead ends: 284 [2021-10-28 23:10:57,576 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-28 23:10:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-10-28 23:10:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4946619217081851) internal successors, (420), 281 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-28 23:10:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2021-10-28 23:10:57,594 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2021-10-28 23:10:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:57,594 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2021-10-28 23:10:57,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2021-10-28 23:10:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-28 23:10:57,597 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:57,597 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:57,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:10:57,598 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2021-10-28 23:10:57,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:57,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596334629] [2021-10-28 23:10:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:57,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:57,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:57,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596334629] [2021-10-28 23:10:57,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596334629] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:57,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:57,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:10:57,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749062038] [2021-10-28 23:10:57,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:10:57,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:10:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:10:57,691 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:57,751 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2021-10-28 23:10:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:10:57,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-10-28 23:10:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:57,757 INFO L225 Difference]: With dead ends: 811 [2021-10-28 23:10:57,758 INFO L226 Difference]: Without dead ends: 580 [2021-10-28 23:10:57,759 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:10:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-28 23:10:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2021-10-28 23:10:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4764397905759161) internal successors, (846), 573 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-28 23:10:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2021-10-28 23:10:57,813 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2021-10-28 23:10:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:57,815 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2021-10-28 23:10:57,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2021-10-28 23:10:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-28 23:10:57,821 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:57,821 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:57,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:10:57,822 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2021-10-28 23:10:57,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:57,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528049344] [2021-10-28 23:10:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:57,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:57,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:57,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528049344] [2021-10-28 23:10:57,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528049344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:57,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:57,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:10:57,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283525148] [2021-10-28 23:10:57,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:10:57,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:10:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:10:57,923 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:58,023 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2021-10-28 23:10:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:10:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-10-28 23:10:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:58,031 INFO L225 Difference]: With dead ends: 1097 [2021-10-28 23:10:58,032 INFO L226 Difference]: Without dead ends: 574 [2021-10-28 23:10:58,033 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:10:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-28 23:10:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2021-10-28 23:10:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.469458987783595) internal successors, (842), 573 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2021-10-28 23:10:58,079 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2021-10-28 23:10:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:58,082 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2021-10-28 23:10:58,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2021-10-28 23:10:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-28 23:10:58,084 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:58,084 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:58,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:10:58,085 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2021-10-28 23:10:58,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:58,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805696406] [2021-10-28 23:10:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:58,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:58,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:58,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805696406] [2021-10-28 23:10:58,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805696406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:58,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:58,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:58,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312947637] [2021-10-28 23:10:58,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:58,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:58,127 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:58,218 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2021-10-28 23:10:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:58,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-10-28 23:10:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:58,226 INFO L225 Difference]: With dead ends: 1592 [2021-10-28 23:10:58,226 INFO L226 Difference]: Without dead ends: 1069 [2021-10-28 23:10:58,228 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-10-28 23:10:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2021-10-28 23:10:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.4598290598290597) internal successors, (854), 585 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2021-10-28 23:10:58,292 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2021-10-28 23:10:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:58,293 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2021-10-28 23:10:58,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2021-10-28 23:10:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-28 23:10:58,295 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:58,295 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:58,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:10:58,296 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2021-10-28 23:10:58,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:58,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331115458] [2021-10-28 23:10:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:58,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:58,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:58,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331115458] [2021-10-28 23:10:58,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331115458] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:58,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:58,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:10:58,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783816419] [2021-10-28 23:10:58,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:10:58,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:10:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:10:58,392 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:58,491 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2021-10-28 23:10:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:10:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-10-28 23:10:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:58,496 INFO L225 Difference]: With dead ends: 1105 [2021-10-28 23:10:58,496 INFO L226 Difference]: Without dead ends: 570 [2021-10-28 23:10:58,498 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:10:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-28 23:10:58,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-10-28 23:10:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.437609841827768) internal successors, (818), 569 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2021-10-28 23:10:58,554 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2021-10-28 23:10:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:58,555 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2021-10-28 23:10:58,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2021-10-28 23:10:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-28 23:10:58,557 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:58,557 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:58,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:10:58,557 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2021-10-28 23:10:58,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:58,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388348634] [2021-10-28 23:10:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:58,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:58,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:58,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388348634] [2021-10-28 23:10:58,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388348634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:58,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:58,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:58,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749493809] [2021-10-28 23:10:58,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:58,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:58,608 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:58,732 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2021-10-28 23:10:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:58,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-10-28 23:10:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:58,741 INFO L225 Difference]: With dead ends: 1592 [2021-10-28 23:10:58,741 INFO L226 Difference]: Without dead ends: 1073 [2021-10-28 23:10:58,744 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2021-10-28 23:10:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2021-10-28 23:10:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4315424610051992) internal successors, (826), 577 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2021-10-28 23:10:58,810 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2021-10-28 23:10:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:58,810 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2021-10-28 23:10:58,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2021-10-28 23:10:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-10-28 23:10:58,814 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:58,814 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:58,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:10:58,815 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2021-10-28 23:10:58,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:58,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363466347] [2021-10-28 23:10:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:58,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:58,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:58,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363466347] [2021-10-28 23:10:58,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363466347] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:58,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:10:58,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:10:58,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517824581] [2021-10-28 23:10:58,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:58,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:58,869 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:58,955 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2021-10-28 23:10:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:58,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-10-28 23:10:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:58,962 INFO L225 Difference]: With dead ends: 1311 [2021-10-28 23:10:58,962 INFO L226 Difference]: Without dead ends: 784 [2021-10-28 23:10:58,964 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:10:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-10-28 23:10:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2021-10-28 23:10:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.449645390070922) internal successors, (1022), 705 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2021-10-28 23:10:59,045 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2021-10-28 23:10:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:59,045 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2021-10-28 23:10:59,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2021-10-28 23:10:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-28 23:10:59,047 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:59,048 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:59,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:10:59,048 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:10:59,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:10:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2021-10-28 23:10:59,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:10:59,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852687410] [2021-10-28 23:10:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:59,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:10:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:10:59,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:10:59,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852687410] [2021-10-28 23:10:59,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852687410] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:10:59,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832519550] [2021-10-28 23:10:59,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:10:59,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:10:59,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:10:59,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:10:59,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 23:10:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:10:59,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:10:59,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:10:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:10:59,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832519550] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:10:59,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:10:59,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-28 23:10:59,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101871840] [2021-10-28 23:10:59,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:10:59,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:10:59,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:10:59,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:10:59,676 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:10:59,774 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2021-10-28 23:10:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:10:59,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 92 [2021-10-28 23:10:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:10:59,780 INFO L225 Difference]: With dead ends: 1341 [2021-10-28 23:10:59,780 INFO L226 Difference]: Without dead ends: 686 [2021-10-28 23:10:59,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:10:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-10-28 23:10:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2021-10-28 23:10:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.429197080291971) internal successors, (979), 685 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2021-10-28 23:10:59,853 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2021-10-28 23:10:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:10:59,854 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2021-10-28 23:10:59,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:10:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2021-10-28 23:10:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-28 23:10:59,855 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:10:59,856 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:10:59,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 23:11:00,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-28 23:11:00,079 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2021-10-28 23:11:00,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:00,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048054105] [2021-10-28 23:11:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:00,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:00,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:00,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048054105] [2021-10-28 23:11:00,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048054105] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:11:00,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582372003] [2021-10-28 23:11:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:00,149 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:11:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:11:00,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:11:00,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 23:11:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:00,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:11:00,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:11:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:00,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582372003] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:00,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:11:00,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-28 23:11:00,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685027525] [2021-10-28 23:11:00,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:00,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:00,602 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:00,748 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2021-10-28 23:11:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-10-28 23:11:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:00,758 INFO L225 Difference]: With dead ends: 2025 [2021-10-28 23:11:00,758 INFO L226 Difference]: Without dead ends: 1364 [2021-10-28 23:11:00,760 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:00,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-10-28 23:11:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2021-10-28 23:11:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4125) internal successors, (1921), 1360 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2021-10-28 23:11:00,894 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2021-10-28 23:11:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:00,894 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2021-10-28 23:11:00,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2021-10-28 23:11:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-28 23:11:00,897 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:00,898 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:00,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 23:11:01,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-28 23:11:01,111 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2021-10-28 23:11:01,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:01,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273814610] [2021-10-28 23:11:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:01,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:01,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:01,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273814610] [2021-10-28 23:11:01,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273814610] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:01,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:01,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:11:01,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328279637] [2021-10-28 23:11:01,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:01,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:01,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:01,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:01,161 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:01,310 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2021-10-28 23:11:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:01,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-10-28 23:11:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:01,320 INFO L225 Difference]: With dead ends: 2736 [2021-10-28 23:11:01,320 INFO L226 Difference]: Without dead ends: 1463 [2021-10-28 23:11:01,323 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2021-10-28 23:11:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2021-10-28 23:11:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1462 states have (on average 1.4008207934336525) internal successors, (2048), 1462 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2021-10-28 23:11:01,454 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2021-10-28 23:11:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:01,454 INFO L470 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2021-10-28 23:11:01,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2021-10-28 23:11:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-28 23:11:01,457 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:01,457 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:01,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:11:01,458 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2021-10-28 23:11:01,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:01,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321769922] [2021-10-28 23:11:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:01,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:01,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:01,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321769922] [2021-10-28 23:11:01,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321769922] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:01,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:01,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:11:01,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494258772] [2021-10-28 23:11:01,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:01,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:01,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:01,514 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:01,643 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2021-10-28 23:11:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-10-28 23:11:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:01,650 INFO L225 Difference]: With dead ends: 2354 [2021-10-28 23:11:01,651 INFO L226 Difference]: Without dead ends: 973 [2021-10-28 23:11:01,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-10-28 23:11:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2021-10-28 23:11:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 1.389917695473251) internal successors, (1351), 972 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2021-10-28 23:11:01,738 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2021-10-28 23:11:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:01,739 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2021-10-28 23:11:01,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2021-10-28 23:11:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:11:01,741 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:01,742 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:01,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 23:11:01,742 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2021-10-28 23:11:01,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:01,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876458992] [2021-10-28 23:11:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:01,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:01,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:01,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876458992] [2021-10-28 23:11:01,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876458992] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:01,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:01,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:11:01,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587831830] [2021-10-28 23:11:01,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:11:01,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:11:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:11:01,802 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:01,853 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2021-10-28 23:11:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:11:01,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:11:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:01,857 INFO L225 Difference]: With dead ends: 1258 [2021-10-28 23:11:01,858 INFO L226 Difference]: Without dead ends: 373 [2021-10-28 23:11:01,859 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:11:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-10-28 23:11:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2021-10-28 23:11:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3548387096774193) internal successors, (504), 372 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2021-10-28 23:11:01,892 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2021-10-28 23:11:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:01,892 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2021-10-28 23:11:01,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2021-10-28 23:11:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:11:01,894 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:01,895 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:01,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 23:11:01,895 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2021-10-28 23:11:01,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:01,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165264970] [2021-10-28 23:11:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:01,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:01,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:01,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165264970] [2021-10-28 23:11:01,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165264970] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:11:01,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16852150] [2021-10-28 23:11:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:01,948 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:11:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:11:01,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:11:01,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 23:11:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:11:02,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:11:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:02,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16852150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:02,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:11:02,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-28 23:11:02,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890040726] [2021-10-28 23:11:02,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:02,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:02,403 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:02,479 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2021-10-28 23:11:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:11:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:02,485 INFO L225 Difference]: With dead ends: 1059 [2021-10-28 23:11:02,485 INFO L226 Difference]: Without dead ends: 732 [2021-10-28 23:11:02,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-28 23:11:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2021-10-28 23:11:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 1.3365384615384615) internal successors, (973), 728 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2021-10-28 23:11:02,552 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2021-10-28 23:11:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:02,553 INFO L470 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2021-10-28 23:11:02,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2021-10-28 23:11:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:11:02,556 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:02,556 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:02,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 23:11:02,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:11:02,773 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:02,773 INFO L85 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2021-10-28 23:11:02,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:02,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188803586] [2021-10-28 23:11:02,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:02,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:02,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:02,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188803586] [2021-10-28 23:11:02,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188803586] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:02,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:02,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:11:02,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146313572] [2021-10-28 23:11:02,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:02,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:02,809 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:02,890 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2021-10-28 23:11:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:11:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:02,896 INFO L225 Difference]: With dead ends: 1382 [2021-10-28 23:11:02,896 INFO L226 Difference]: Without dead ends: 811 [2021-10-28 23:11:02,898 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-10-28 23:11:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2021-10-28 23:11:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.317283950617284) internal successors, (1067), 810 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2021-10-28 23:11:02,972 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2021-10-28 23:11:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:02,973 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2021-10-28 23:11:02,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2021-10-28 23:11:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 23:11:02,975 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:02,976 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:02,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 23:11:02,976 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2021-10-28 23:11:02,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:02,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931777112] [2021-10-28 23:11:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:02,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:03,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:03,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931777112] [2021-10-28 23:11:03,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931777112] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:03,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:03,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:11:03,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28007593] [2021-10-28 23:11:03,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:03,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:03,004 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:03,067 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2021-10-28 23:11:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:03,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-28 23:11:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:03,071 INFO L225 Difference]: With dead ends: 1208 [2021-10-28 23:11:03,072 INFO L226 Difference]: Without dead ends: 551 [2021-10-28 23:11:03,073 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:11:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-10-28 23:11:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2021-10-28 23:11:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2021-10-28 23:11:03,114 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2021-10-28 23:11:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:03,115 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2021-10-28 23:11:03,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2021-10-28 23:11:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 23:11:03,117 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:03,117 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:03,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 23:11:03,118 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2021-10-28 23:11:03,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:03,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333797898] [2021-10-28 23:11:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:03,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:03,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:03,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333797898] [2021-10-28 23:11:03,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333797898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:03,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:03,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:11:03,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513334458] [2021-10-28 23:11:03,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:11:03,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:03,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:11:03,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:11:03,195 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:03,238 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2021-10-28 23:11:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:11:03,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 95 [2021-10-28 23:11:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:03,241 INFO L225 Difference]: With dead ends: 820 [2021-10-28 23:11:03,241 INFO L226 Difference]: Without dead ends: 427 [2021-10-28 23:11:03,242 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:11:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-10-28 23:11:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-10-28 23:11:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.272300469483568) internal successors, (542), 426 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2021-10-28 23:11:03,275 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2021-10-28 23:11:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:03,275 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2021-10-28 23:11:03,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2021-10-28 23:11:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 23:11:03,277 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:03,277 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:03,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 23:11:03,278 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2021-10-28 23:11:03,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:03,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975127418] [2021-10-28 23:11:03,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:03,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:03,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:03,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975127418] [2021-10-28 23:11:03,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975127418] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:11:03,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463638766] [2021-10-28 23:11:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:03,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:11:03,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:11:03,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:11:03,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-28 23:11:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:03,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-28 23:11:03,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:11:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-28 23:11:03,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463638766] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:03,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:11:03,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-10-28 23:11:03,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286578603] [2021-10-28 23:11:03,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:11:03,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:11:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:03,820 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:03,907 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2021-10-28 23:11:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:11:03,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 95 [2021-10-28 23:11:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:03,913 INFO L225 Difference]: With dead ends: 1163 [2021-10-28 23:11:03,913 INFO L226 Difference]: Without dead ends: 822 [2021-10-28 23:11:03,914 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2021-10-28 23:11:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2021-10-28 23:11:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.2506112469437654) internal successors, (1023), 818 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2021-10-28 23:11:03,982 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2021-10-28 23:11:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:03,983 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2021-10-28 23:11:03,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2021-10-28 23:11:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 23:11:03,986 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:03,986 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:04,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-28 23:11:04,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-28 23:11:04,208 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2021-10-28 23:11:04,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:04,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755082428] [2021-10-28 23:11:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:04,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:04,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:04,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755082428] [2021-10-28 23:11:04,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755082428] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:11:04,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189321817] [2021-10-28 23:11:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:04,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:11:04,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:11:04,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:11:04,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-28 23:11:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:04,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-28 23:11:04,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:11:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:04,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189321817] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:04,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-28 23:11:04,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-10-28 23:11:04,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464705748] [2021-10-28 23:11:04,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:11:04,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:04,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:11:04,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:04,935 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:05,066 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2021-10-28 23:11:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:11:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-10-28 23:11:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:05,074 INFO L225 Difference]: With dead ends: 1704 [2021-10-28 23:11:05,074 INFO L226 Difference]: Without dead ends: 1054 [2021-10-28 23:11:05,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-10-28 23:11:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2021-10-28 23:11:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.2542037586547972) internal successors, (1268), 1011 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2021-10-28 23:11:05,167 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2021-10-28 23:11:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:05,168 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2021-10-28 23:11:05,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2021-10-28 23:11:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 23:11:05,170 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:05,171 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:05,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-28 23:11:05,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-28 23:11:05,387 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2021-10-28 23:11:05,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:05,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459128758] [2021-10-28 23:11:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:05,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:05,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:05,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459128758] [2021-10-28 23:11:05,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459128758] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:05,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:05,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:11:05,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455136589] [2021-10-28 23:11:05,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:11:05,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:11:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:11:05,437 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:05,604 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2021-10-28 23:11:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:11:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-10-28 23:11:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:05,615 INFO L225 Difference]: With dead ends: 2540 [2021-10-28 23:11:05,615 INFO L226 Difference]: Without dead ends: 1698 [2021-10-28 23:11:05,617 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:11:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2021-10-28 23:11:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2021-10-28 23:11:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.249757045675413) internal successors, (1286), 1029 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2021-10-28 23:11:05,722 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2021-10-28 23:11:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:05,722 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2021-10-28 23:11:05,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2021-10-28 23:11:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 23:11:05,725 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:11:05,725 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:05,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 23:11:05,725 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:11:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:11:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2021-10-28 23:11:05,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:11:05,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825627985] [2021-10-28 23:11:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:11:05,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:11:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:11:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:05,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:11:05,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825627985] [2021-10-28 23:11:05,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825627985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:05,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:05,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:11:05,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060473277] [2021-10-28 23:11:05,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:11:05,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:11:05,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:11:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:11:05,791 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:05,868 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2021-10-28 23:11:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:11:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2021-10-28 23:11:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:05,869 INFO L225 Difference]: With dead ends: 1285 [2021-10-28 23:11:05,870 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 23:11:05,871 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:11:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 23:11:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 23:11:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 23:11:05,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-10-28 23:11:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:05,873 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 23:11:05,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:11:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 23:11:05,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 23:11:05,876 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:11:05,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 23:11:05,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 23:11:05,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:05,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:05,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:05,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:06,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:10,349 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 404) no Hoare annotation was computed. [2021-10-28 23:11:10,350 INFO L853 garLoopResultBuilder]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse15 (= ~b1_ev~0 1)) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (= ~d0_ev~0 1)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-28 23:11:10,351 INFO L853 garLoopResultBuilder]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,351 INFO L853 garLoopResultBuilder]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,352 INFO L853 garLoopResultBuilder]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,352 INFO L853 garLoopResultBuilder]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,352 INFO L853 garLoopResultBuilder]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,353 INFO L853 garLoopResultBuilder]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,353 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 118) no Hoare annotation was computed. [2021-10-28 23:11:10,353 INFO L857 garLoopResultBuilder]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2021-10-28 23:11:10,353 INFO L857 garLoopResultBuilder]: For program point L71(lines 43 93) no Hoare annotation was computed. [2021-10-28 23:11:10,353 INFO L860 garLoopResultBuilder]: At program point L501(lines 485 503) the Hoare annotation is: true [2021-10-28 23:11:10,354 INFO L853 garLoopResultBuilder]: At program point L303(lines 271 308) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,354 INFO L857 garLoopResultBuilder]: For program point L204(lines 204 210) no Hoare annotation was computed. [2021-10-28 23:11:10,354 INFO L853 garLoopResultBuilder]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (<= 2 ~d1_ev~0) (not (= ~b1_val_t~0 0)) (= ~d0_req_up~0 1) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (= ~d1_req_up~0 1) (not (= ~b0_req_up~0 1)) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0)) [2021-10-28 23:11:10,354 INFO L857 garLoopResultBuilder]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2021-10-28 23:11:10,354 INFO L853 garLoopResultBuilder]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,354 INFO L857 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-10-28 23:11:10,354 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 117) no Hoare annotation was computed. [2021-10-28 23:11:10,355 INFO L857 garLoopResultBuilder]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2021-10-28 23:11:10,355 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 179) no Hoare annotation was computed. [2021-10-28 23:11:10,355 INFO L857 garLoopResultBuilder]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2021-10-28 23:11:10,355 INFO L857 garLoopResultBuilder]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2021-10-28 23:11:10,355 INFO L857 garLoopResultBuilder]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2021-10-28 23:11:10,355 INFO L853 garLoopResultBuilder]: At program point L406(lines 395 408) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,355 INFO L853 garLoopResultBuilder]: At program point L407(lines 391 409) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,355 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-10-28 23:11:10,356 INFO L857 garLoopResultBuilder]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2021-10-28 23:11:10,356 INFO L857 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-10-28 23:11:10,356 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-10-28 23:11:10,356 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-10-28 23:11:10,356 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 116) no Hoare annotation was computed. [2021-10-28 23:11:10,356 INFO L857 garLoopResultBuilder]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-10-28 23:11:10,357 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2021-10-28 23:11:10,357 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-28 23:11:10,357 INFO L857 garLoopResultBuilder]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-10-28 23:11:10,357 INFO L857 garLoopResultBuilder]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2021-10-28 23:11:10,357 INFO L853 garLoopResultBuilder]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (= ~d0_req_up~0 1)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (= ~d1_req_up~0 1)) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~b1_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~b1_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-10-28 23:11:10,358 INFO L853 garLoopResultBuilder]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,359 INFO L857 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2021-10-28 23:11:10,359 INFO L857 garLoopResultBuilder]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,359 INFO L857 garLoopResultBuilder]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L853 garLoopResultBuilder]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse6 (= ~b1_ev~0 0)) (.cse8 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse15 (= ~d0_ev~0 0)) (.cse5 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~d1_val~0 0))) (.cse10 (= ~z_val~0 0)) (.cse11 (not (= ~d0_val_t~0 0))) (.cse12 (not (= ~b1_val~0 0))) (.cse13 (not (= ~b0_req_up~0 1))) (.cse14 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse15 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L853 garLoopResultBuilder]: At program point L447(lines 493 499) the Hoare annotation is: (and (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2021-10-28 23:11:10,360 INFO L857 garLoopResultBuilder]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2021-10-28 23:11:10,361 INFO L857 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2021-10-28 23:11:10,361 INFO L853 garLoopResultBuilder]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse9 (= ~b1_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~z_val~0 0)) (.cse17 (= ~d0_ev~0 1)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15))) [2021-10-28 23:11:10,361 INFO L857 garLoopResultBuilder]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2021-10-28 23:11:10,361 INFO L853 garLoopResultBuilder]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,362 INFO L853 garLoopResultBuilder]: At program point L482(lines 453 484) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~z_ev~0 2) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~d0_ev~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0)) [2021-10-28 23:11:10,362 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 23:11:10,362 INFO L853 garLoopResultBuilder]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse10 (<= 2 ~d0_ev~0)) (.cse17 (= ~b1_ev~0 0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_val~0 0))) (.cse6 (= ~z_ev~0 2)) (.cse18 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (<= 2 ~d1_ev~0)) (.cse9 (not (= ~b1_val_t~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (= ~d1_req_up~0 1)) (.cse15 (not (= ~b0_req_up~0 1))) (.cse16 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse18 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-10-28 23:11:10,362 INFO L853 garLoopResultBuilder]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,362 INFO L857 garLoopResultBuilder]: For program point L53(lines 43 93) no Hoare annotation was computed. [2021-10-28 23:11:10,363 INFO L857 garLoopResultBuilder]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,363 INFO L857 garLoopResultBuilder]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,363 INFO L857 garLoopResultBuilder]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,363 INFO L857 garLoopResultBuilder]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,363 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-10-28 23:11:10,364 INFO L853 garLoopResultBuilder]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse9 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (= ~b0_ev~0 1)) (.cse6 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse7 (not (= ~d0_val~0 0))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= ~d0_val_t~0 0))) (.cse14 (not (= ~b1_val~0 0))) (.cse15 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse13 .cse14 .cse15))) [2021-10-28 23:11:10,364 INFO L853 garLoopResultBuilder]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,364 INFO L853 garLoopResultBuilder]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (<= 2 ~b1_ev~0)) (.cse3 (not (= ~b0_val~0 0))) (.cse4 (= ~z_ev~0 2)) (.cse5 (not (= ~d0_val~0 0))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse7 (<= 2 ~d0_ev~0)) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 (= ~comp_m1_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= 0 ~z_val_t~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,365 INFO L853 garLoopResultBuilder]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse17 (= ~b1_ev~0 1)) (.cse12 (= ~d0_ev~0 1)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0))) (.cse8 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse13 (not (= |ULTIMATE.start_is_method1_triggered_#res| 0))) (.cse14 (not (= ~d0_val_t~0 0))) (.cse15 (not (= ~b1_val~0 0))) (.cse16 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16))) [2021-10-28 23:11:10,365 INFO L853 garLoopResultBuilder]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_is_method1_triggered_~__retres1~0 0)) .cse6 .cse7 .cse8 .cse9 (= ~d0_ev~0 1) (not (= |ULTIMATE.start_is_method1_triggered_#res| 0)) .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,365 INFO L857 garLoopResultBuilder]: For program point L189(lines 189 194) no Hoare annotation was computed. [2021-10-28 23:11:10,365 INFO L857 garLoopResultBuilder]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2021-10-28 23:11:10,365 INFO L857 garLoopResultBuilder]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2021-10-28 23:11:10,366 INFO L857 garLoopResultBuilder]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2021-10-28 23:11:10,366 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 23:11:10,366 INFO L857 garLoopResultBuilder]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,366 INFO L857 garLoopResultBuilder]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,366 INFO L857 garLoopResultBuilder]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,367 INFO L857 garLoopResultBuilder]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,367 INFO L857 garLoopResultBuilder]: For program point L291(lines 291 298) no Hoare annotation was computed. [2021-10-28 23:11:10,367 INFO L853 garLoopResultBuilder]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-10-28 23:11:10,367 INFO L853 garLoopResultBuilder]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,368 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-28 23:11:10,368 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-28 23:11:10,368 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-28 23:11:10,368 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-28 23:11:10,368 INFO L853 garLoopResultBuilder]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0) (not (= 1 ~b1_req_up~0)) (<= 2 ~b1_ev~0) (not (= ~b0_val~0 0)) (= ~z_ev~0 2) (not (= ~d0_val~0 0)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~d1_val~0 0)) (= ~z_val~0 0) (not (= ~d0_val_t~0 0)) (not (= ~b1_val~0 0)) (<= 2 ~b0_ev~0) (not (= ~b0_req_up~0 1))) [2021-10-28 23:11:10,369 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 23:11:10,369 INFO L857 garLoopResultBuilder]: For program point L425(line 425) no Hoare annotation was computed. [2021-10-28 23:11:10,369 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 265) no Hoare annotation was computed. [2021-10-28 23:11:10,369 INFO L857 garLoopResultBuilder]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2021-10-28 23:11:10,369 INFO L857 garLoopResultBuilder]: For program point L129(lines 129 134) no Hoare annotation was computed. [2021-10-28 23:11:10,370 INFO L857 garLoopResultBuilder]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2021-10-28 23:11:10,370 INFO L857 garLoopResultBuilder]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2021-10-28 23:11:10,370 INFO L857 garLoopResultBuilder]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2021-10-28 23:11:10,370 INFO L860 garLoopResultBuilder]: At program point L493(lines 493 499) the Hoare annotation is: true [2021-10-28 23:11:10,370 INFO L857 garLoopResultBuilder]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,370 INFO L857 garLoopResultBuilder]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,371 INFO L857 garLoopResultBuilder]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2021-10-28 23:11:10,371 INFO L857 garLoopResultBuilder]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2021-10-28 23:11:10,371 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 69) no Hoare annotation was computed. [2021-10-28 23:11:10,371 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 23:11:10,371 INFO L857 garLoopResultBuilder]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2021-10-28 23:11:10,372 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-28 23:11:10,372 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 119) no Hoare annotation was computed. [2021-10-28 23:11:10,372 INFO L857 garLoopResultBuilder]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2021-10-28 23:11:10,372 INFO L853 garLoopResultBuilder]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (= ~comp_m1_st~0 0)) (.cse17 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (= ~d0_ev~0 0)) (.cse7 (not (= ~d0_val~0 0))) (.cse9 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~z_val~0 0)) (.cse12 (not (= ~d0_val_t~0 0))) (.cse13 (not (= ~b1_val~0 0))) (.cse14 (not (= ~b0_req_up~0 1))) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-10-28 23:11:10,373 INFO L853 garLoopResultBuilder]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (not (= ~d1_val_t~0 0))) (.cse1 (= 0 ~z_val_t~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (<= 2 ~b1_ev~0)) (.cse4 (not (= ~b0_val~0 0))) (.cse5 (= ~z_ev~0 2)) (.cse6 (not (= ~d0_val~0 0))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~d1_val~0 0))) (.cse9 (= ~z_val~0 0)) (.cse10 (not (= ~d0_val_t~0 0))) (.cse11 (not (= ~b1_val~0 0))) (.cse12 (<= 2 ~b0_ev~0)) (.cse13 (not (= ~b0_req_up~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~d0_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-10-28 23:11:10,377 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:11:10,379 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:11:10,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:11:10 BoogieIcfgContainer [2021-10-28 23:11:10,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:11:10,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:11:10,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:11:10,456 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:11:10,457 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:10:55" (3/4) ... [2021-10-28 23:11:10,461 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 23:11:10,486 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 23:11:10,491 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 23:11:10,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:11:10,493 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:11:10,532 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) [2021-10-28 23:11:10,536 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-10-28 23:11:10,538 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) [2021-10-28 23:11:10,646 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:11:10,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:11:10,649 INFO L168 Benchmark]: Toolchain (without parser) took 16891.57 ms. Allocated memory was 119.5 MB in the beginning and 281.0 MB in the end (delta: 161.5 MB). Free memory was 87.2 MB in the beginning and 132.8 MB in the end (delta: -45.6 MB). Peak memory consumption was 117.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,649 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 77.6 MB. Free memory is still 44.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:11:10,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.19 ms. Allocated memory is still 119.5 MB. Free memory was 86.9 MB in the beginning and 74.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.18 ms. Allocated memory is still 119.5 MB. Free memory was 74.3 MB in the beginning and 71.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,651 INFO L168 Benchmark]: Boogie Preprocessor took 71.50 ms. Allocated memory is still 119.5 MB. Free memory was 71.9 MB in the beginning and 70.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,652 INFO L168 Benchmark]: RCFGBuilder took 776.83 ms. Allocated memory is still 119.5 MB. Free memory was 70.0 MB in the beginning and 51.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,652 INFO L168 Benchmark]: TraceAbstraction took 15342.34 ms. Allocated memory was 119.5 MB in the beginning and 281.0 MB in the end (delta: 161.5 MB). Free memory was 51.1 MB in the beginning and 142.2 MB in the end (delta: -91.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,653 INFO L168 Benchmark]: Witness Printer took 190.78 ms. Allocated memory is still 281.0 MB. Free memory was 142.2 MB in the beginning and 132.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:10,660 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.30 ms. Allocated memory is still 77.6 MB. Free memory is still 44.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 419.19 ms. Allocated memory is still 119.5 MB. Free memory was 86.9 MB in the beginning and 74.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.18 ms. Allocated memory is still 119.5 MB. Free memory was 74.3 MB in the beginning and 71.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.50 ms. Allocated memory is still 119.5 MB. Free memory was 71.9 MB in the beginning and 70.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 776.83 ms. Allocated memory is still 119.5 MB. Free memory was 70.0 MB in the beginning and 51.7 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15342.34 ms. Allocated memory was 119.5 MB in the beginning and 281.0 MB in the end (delta: 161.5 MB). Free memory was 51.1 MB in the beginning and 142.2 MB in the end (delta: -91.1 MB). Peak memory consumption was 101.1 MB. Max. memory is 16.1 GB. * Witness Printer took 190.78 ms. Allocated memory is still 281.0 MB. Free memory was 142.2 MB in the beginning and 132.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4786 SDtfs, 2809 SDslu, 5283 SDs, 0 SdLazy, 418 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 2142 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3769 HoareAnnotationTreeSize, 33 FomulaSimplifications, 63912 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 4734 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 5233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && b1_ev == 0) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && 2 <= d1_ev) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(tmp == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || ((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(\result == 0)) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(\result == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && 2 <= d1_ev) && !(b1_val_t == 0)) && d0_req_up == 1) && 2 <= d0_ev) && z_val == 0) && !(d0_val_t == 0)) && d1_req_up == 1) && !(b0_req_up == 1)) && b0_ev == 0) && 1 == b1_req_up - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && !(__retres1 == 0)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && b1_ev == 1) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && d0_ev == 1) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1))) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && b0_ev == 1) && !(__retres1 == 0)) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((0 == z_val_t && !(1 == b1_req_up)) && !(d0_val == 0)) && !(b1_val_t == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1) - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((b0_req_up == 1 && 0 == z_val_t) && comp_m1_st == 0) && 2 <= b1_ev) && d0_val_t == b0_val_t) && z_ev == 2) && b0_val_t == 1) && 2 <= d1_ev) && d0_req_up == 1) && b0_val == 0) && d1_val_t == b0_val_t) && 2 <= d0_ev) && z_val == 0) && 2 <= b0_ev) && d1_req_up == 1) && 1 == b1_req_up) && b1_val_t == b0_val_t - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((!(d1_val_t == 0) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) || ((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && 2 <= b0_ev) && !(b0_req_up == 1)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && b1_ev == 0) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && !(d0_val == 0)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0)) || (((((((((((((((!(d1_val_t == 0) && 0 == z_val_t) && !(1 == b1_req_up)) && comp_m1_st == 0) && 2 <= b1_ev) && !(b0_val == 0)) && z_ev == 2) && d0_ev == 0) && !(d0_val == 0)) && !(b1_val_t == 0)) && !(d1_val == 0)) && z_val == 0) && !(d0_val_t == 0)) && !(b1_val == 0)) && !(b0_req_up == 1)) && b0_ev == 0) RESULT: Ultimate proved your program to be correct! [2021-10-28 23:11:10,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935c0914-3080-461c-8933-110724ace425/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...