./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10.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_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/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_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/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_4b5879ac-09b3-443b-989a-c4b414ecdc20/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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 00:03:34,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 00:03:34,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 00:03:34,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 00:03:34,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 00:03:34,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 00:03:34,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 00:03:34,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 00:03:34,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 00:03:34,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 00:03:34,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 00:03:34,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 00:03:34,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 00:03:34,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 00:03:34,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 00:03:34,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 00:03:34,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 00:03:34,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 00:03:34,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 00:03:34,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 00:03:34,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 00:03:34,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 00:03:34,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 00:03:34,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 00:03:34,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 00:03:34,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 00:03:34,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 00:03:34,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 00:03:34,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 00:03:34,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 00:03:34,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 00:03:34,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 00:03:34,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 00:03:34,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 00:03:34,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 00:03:34,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 00:03:34,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 00:03:34,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 00:03:34,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 00:03:34,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 00:03:34,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 00:03:34,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-29 00:03:34,655 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 00:03:34,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 00:03:34,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-29 00:03:34,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-29 00:03:34,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 00:03:34,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 00:03:34,662 INFO L138 SettingsManager]: * Use SBE=true [2021-10-29 00:03:34,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 00:03:34,663 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 00:03:34,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 00:03:34,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 00:03:34,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 00:03:34,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 00:03:34,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 00:03:34,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 00:03:34,664 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 00:03:34,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 00:03:34,665 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 00:03:34,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 00:03:34,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 00:03:34,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-29 00:03:34,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 00:03:34,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 00:03:34,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 00:03:34,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 00:03:34,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 00:03:34,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-29 00:03:34,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 00:03:34,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-29 00:03:34,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-29 00:03:34,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 00:03:34,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 00:03:34,668 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_4b5879ac-09b3-443b-989a-c4b414ecdc20/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_4b5879ac-09b3-443b-989a-c4b414ecdc20/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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2021-10-29 00:03:34,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 00:03:35,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 00:03:35,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 00:03:35,029 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 00:03:35,031 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 00:03:35,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/locks/test_locks_10.c [2021-10-29 00:03:35,137 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/data/6b72e898c/ff780cb1380a422b8031e0c7baa5f3c8/FLAG3cef11782 [2021-10-29 00:03:35,705 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 00:03:35,713 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/sv-benchmarks/c/locks/test_locks_10.c [2021-10-29 00:03:35,726 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/data/6b72e898c/ff780cb1380a422b8031e0c7baa5f3c8/FLAG3cef11782 [2021-10-29 00:03:36,032 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/data/6b72e898c/ff780cb1380a422b8031e0c7baa5f3c8 [2021-10-29 00:03:36,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 00:03:36,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 00:03:36,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 00:03:36,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 00:03:36,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 00:03:36,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243e3522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36, skipping insertion in model container [2021-10-29 00:03:36,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 00:03:36,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 00:03:36,364 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_4b5879ac-09b3-443b-989a-c4b414ecdc20/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2021-10-29 00:03:36,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:03:36,380 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 00:03:36,412 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_4b5879ac-09b3-443b-989a-c4b414ecdc20/sv-benchmarks/c/locks/test_locks_10.c[3901,3914] [2021-10-29 00:03:36,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:03:36,429 INFO L208 MainTranslator]: Completed translation [2021-10-29 00:03:36,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36 WrapperNode [2021-10-29 00:03:36,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 00:03:36,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 00:03:36,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 00:03:36,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 00:03:36,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 00:03:36,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 00:03:36,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 00:03:36,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 00:03:36,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 00:03:36,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 00:03:36,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 00:03:36,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 00:03:36,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (1/1) ... [2021-10-29 00:03:36,516 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 00:03:36,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:03:36,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 00:03:36,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 00:03:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 00:03:36,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 00:03:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 00:03:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 00:03:37,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 00:03:37,066 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-29 00:03:37,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:03:37 BoogieIcfgContainer [2021-10-29 00:03:37,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 00:03:37,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 00:03:37,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 00:03:37,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 00:03:37,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 12:03:36" (1/3) ... [2021-10-29 00:03:37,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a808d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 12:03:37, skipping insertion in model container [2021-10-29 00:03:37,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:36" (2/3) ... [2021-10-29 00:03:37,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a808d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 12:03:37, skipping insertion in model container [2021-10-29 00:03:37,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:03:37" (3/3) ... [2021-10-29 00:03:37,079 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2021-10-29 00:03:37,085 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 00:03:37,085 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 00:03:37,136 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 00:03:37,144 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-29 00:03:37,145 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 00:03:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 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-29 00:03:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 00:03:37,169 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:37,170 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:37,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:37,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash 153349273, now seen corresponding path program 1 times [2021-10-29 00:03:37,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:37,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806883063] [2021-10-29 00:03:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:37,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:37,406 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-29 00:03:37,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:37,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806883063] [2021-10-29 00:03:37,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806883063] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:37,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:37,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:37,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311457783] [2021-10-29 00:03:37,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:37,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:37,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:37,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:37,433 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 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) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:37,487 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2021-10-29 00:03:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 00:03:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:37,504 INFO L225 Difference]: With dead ends: 83 [2021-10-29 00:03:37,504 INFO L226 Difference]: Without dead ends: 69 [2021-10-29 00:03:37,508 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-29 00:03:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-29 00:03:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2021-10-29 00:03:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 46 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-29 00:03:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2021-10-29 00:03:37,565 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 17 [2021-10-29 00:03:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:37,581 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 86 transitions. [2021-10-29 00:03:37,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2021-10-29 00:03:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 00:03:37,583 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:37,583 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:37,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 00:03:37,584 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:37,586 INFO L85 PathProgramCache]: Analyzing trace with hash -433456741, now seen corresponding path program 1 times [2021-10-29 00:03:37,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:37,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846054116] [2021-10-29 00:03:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:37,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:37,690 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-29 00:03:37,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:37,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846054116] [2021-10-29 00:03:37,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846054116] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:37,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:37,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:37,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9896220] [2021-10-29 00:03:37,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:37,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:37,696 INFO L87 Difference]: Start difference. First operand 47 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:37,745 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2021-10-29 00:03:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-29 00:03:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:37,749 INFO L225 Difference]: With dead ends: 114 [2021-10-29 00:03:37,751 INFO L226 Difference]: Without dead ends: 69 [2021-10-29 00:03:37,752 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-29 00:03:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-29 00:03:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2021-10-29 00:03:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2021-10-29 00:03:37,779 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 17 [2021-10-29 00:03:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:37,780 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2021-10-29 00:03:37,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2021-10-29 00:03:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 00:03:37,782 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:37,782 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:37,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 00:03:37,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash 459073515, now seen corresponding path program 1 times [2021-10-29 00:03:37,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:37,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178468690] [2021-10-29 00:03:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:37,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:37,891 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-29 00:03:37,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:37,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178468690] [2021-10-29 00:03:37,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178468690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:37,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:37,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:37,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286565747] [2021-10-29 00:03:37,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:37,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:37,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:37,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:37,903 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:37,933 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2021-10-29 00:03:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:37,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-29 00:03:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:37,937 INFO L225 Difference]: With dead ends: 105 [2021-10-29 00:03:37,937 INFO L226 Difference]: Without dead ends: 72 [2021-10-29 00:03:37,938 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-29 00:03:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-29 00:03:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-10-29 00:03:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 69 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 124 transitions. [2021-10-29 00:03:37,957 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 124 transitions. Word has length 18 [2021-10-29 00:03:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:37,958 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 124 transitions. [2021-10-29 00:03:37,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2021-10-29 00:03:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 00:03:37,961 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:37,961 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:37,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 00:03:37,962 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -552043735, now seen corresponding path program 1 times [2021-10-29 00:03:37,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:37,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793230908] [2021-10-29 00:03:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:37,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,067 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-29 00:03:38,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793230908] [2021-10-29 00:03:38,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793230908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937070180] [2021-10-29 00:03:38,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,076 INFO L87 Difference]: Start difference. First operand 70 states and 124 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,110 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2021-10-29 00:03:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-29 00:03:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,113 INFO L225 Difference]: With dead ends: 133 [2021-10-29 00:03:38,113 INFO L226 Difference]: Without dead ends: 131 [2021-10-29 00:03:38,114 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-29 00:03:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-29 00:03:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2021-10-29 00:03:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.7934782608695652) internal successors, (165), 92 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 165 transitions. [2021-10-29 00:03:38,145 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 165 transitions. Word has length 18 [2021-10-29 00:03:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,145 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 165 transitions. [2021-10-29 00:03:38,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 165 transitions. [2021-10-29 00:03:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 00:03:38,147 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,147 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:38,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 00:03:38,148 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1138849749, now seen corresponding path program 1 times [2021-10-29 00:03:38,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228065700] [2021-10-29 00:03:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,217 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-29 00:03:38,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228065700] [2021-10-29 00:03:38,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228065700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887842590] [2021-10-29 00:03:38,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,223 INFO L87 Difference]: Start difference. First operand 93 states and 165 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,251 INFO L93 Difference]: Finished difference Result 221 states and 395 transitions. [2021-10-29 00:03:38,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-29 00:03:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,254 INFO L225 Difference]: With dead ends: 221 [2021-10-29 00:03:38,254 INFO L226 Difference]: Without dead ends: 133 [2021-10-29 00:03:38,256 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-29 00:03:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-29 00:03:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2021-10-29 00:03:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 130 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 231 transitions. [2021-10-29 00:03:38,282 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 231 transitions. Word has length 18 [2021-10-29 00:03:38,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,283 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 231 transitions. [2021-10-29 00:03:38,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 231 transitions. [2021-10-29 00:03:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 00:03:38,287 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,287 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:38,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 00:03:38,288 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 66727088, now seen corresponding path program 1 times [2021-10-29 00:03:38,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234172010] [2021-10-29 00:03:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,367 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-29 00:03:38,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234172010] [2021-10-29 00:03:38,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234172010] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654852559] [2021-10-29 00:03:38,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,378 INFO L87 Difference]: Start difference. First operand 131 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,396 INFO L93 Difference]: Finished difference Result 198 states and 346 transitions. [2021-10-29 00:03:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 00:03:38,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,403 INFO L225 Difference]: With dead ends: 198 [2021-10-29 00:03:38,404 INFO L226 Difference]: Without dead ends: 135 [2021-10-29 00:03:38,405 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-29 00:03:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-10-29 00:03:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-10-29 00:03:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.75) internal successors, (231), 132 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 231 transitions. [2021-10-29 00:03:38,418 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 231 transitions. Word has length 19 [2021-10-29 00:03:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,419 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 231 transitions. [2021-10-29 00:03:38,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 231 transitions. [2021-10-29 00:03:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 00:03:38,421 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,421 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:38,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 00:03:38,421 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash -944390162, now seen corresponding path program 1 times [2021-10-29 00:03:38,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694463150] [2021-10-29 00:03:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,492 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-29 00:03:38,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694463150] [2021-10-29 00:03:38,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694463150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185411875] [2021-10-29 00:03:38,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,496 INFO L87 Difference]: Start difference. First operand 133 states and 231 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,514 INFO L93 Difference]: Finished difference Result 381 states and 665 transitions. [2021-10-29 00:03:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 00:03:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,517 INFO L225 Difference]: With dead ends: 381 [2021-10-29 00:03:38,517 INFO L226 Difference]: Without dead ends: 255 [2021-10-29 00:03:38,518 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-29 00:03:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-10-29 00:03:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2021-10-29 00:03:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7261904761904763) internal successors, (435), 252 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 435 transitions. [2021-10-29 00:03:38,533 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 435 transitions. Word has length 19 [2021-10-29 00:03:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,533 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 435 transitions. [2021-10-29 00:03:38,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 435 transitions. [2021-10-29 00:03:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 00:03:38,536 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,536 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:38,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 00:03:38,537 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash -357584148, now seen corresponding path program 1 times [2021-10-29 00:03:38,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544014749] [2021-10-29 00:03:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,582 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-29 00:03:38,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544014749] [2021-10-29 00:03:38,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544014749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252464595] [2021-10-29 00:03:38,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,587 INFO L87 Difference]: Start difference. First operand 253 states and 435 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,626 INFO L93 Difference]: Finished difference Result 321 states and 557 transitions. [2021-10-29 00:03:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 00:03:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,629 INFO L225 Difference]: With dead ends: 321 [2021-10-29 00:03:38,631 INFO L226 Difference]: Without dead ends: 319 [2021-10-29 00:03:38,631 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-29 00:03:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-10-29 00:03:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 253. [2021-10-29 00:03:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.7103174603174602) internal successors, (431), 252 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 431 transitions. [2021-10-29 00:03:38,651 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 431 transitions. Word has length 19 [2021-10-29 00:03:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,651 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 431 transitions. [2021-10-29 00:03:38,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 431 transitions. [2021-10-29 00:03:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 00:03:38,659 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,660 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] [2021-10-29 00:03:38,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 00:03:38,660 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 788890080, now seen corresponding path program 1 times [2021-10-29 00:03:38,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051630525] [2021-10-29 00:03:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,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-29 00:03:38,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051630525] [2021-10-29 00:03:38,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051630525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544806360] [2021-10-29 00:03:38,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,719 INFO L87 Difference]: Start difference. First operand 253 states and 431 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,750 INFO L93 Difference]: Finished difference Result 469 states and 809 transitions. [2021-10-29 00:03:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 00:03:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,755 INFO L225 Difference]: With dead ends: 469 [2021-10-29 00:03:38,755 INFO L226 Difference]: Without dead ends: 467 [2021-10-29 00:03:38,755 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-29 00:03:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2021-10-29 00:03:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 353. [2021-10-29 00:03:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.6789772727272727) internal successors, (591), 352 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 591 transitions. [2021-10-29 00:03:38,788 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 591 transitions. Word has length 20 [2021-10-29 00:03:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,789 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 591 transitions. [2021-10-29 00:03:38,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 591 transitions. [2021-10-29 00:03:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 00:03:38,791 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,791 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] [2021-10-29 00:03:38,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 00:03:38,792 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 202084066, now seen corresponding path program 1 times [2021-10-29 00:03:38,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662149017] [2021-10-29 00:03:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,850 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-29 00:03:38,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662149017] [2021-10-29 00:03:38,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662149017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855713867] [2021-10-29 00:03:38,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,854 INFO L87 Difference]: Start difference. First operand 353 states and 591 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,898 INFO L93 Difference]: Finished difference Result 837 states and 1409 transitions. [2021-10-29 00:03:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 00:03:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,903 INFO L225 Difference]: With dead ends: 837 [2021-10-29 00:03:38,903 INFO L226 Difference]: Without dead ends: 491 [2021-10-29 00:03:38,906 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-29 00:03:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-10-29 00:03:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2021-10-29 00:03:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.6618852459016393) internal successors, (811), 488 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 811 transitions. [2021-10-29 00:03:38,931 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 811 transitions. Word has length 20 [2021-10-29 00:03:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,931 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 811 transitions. [2021-10-29 00:03:38,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 811 transitions. [2021-10-29 00:03:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 00:03:38,933 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,933 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] [2021-10-29 00:03:38,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 00:03:38,933 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:38,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1313996925, now seen corresponding path program 1 times [2021-10-29 00:03:38,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687094550] [2021-10-29 00:03:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,990 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-29 00:03:38,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687094550] [2021-10-29 00:03:38,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687094550] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:38,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372814009] [2021-10-29 00:03:38,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:38,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:38,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:38,995 INFO L87 Difference]: Start difference. First operand 489 states and 811 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,018 INFO L93 Difference]: Finished difference Result 741 states and 1225 transitions. [2021-10-29 00:03:39,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-29 00:03:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,022 INFO L225 Difference]: With dead ends: 741 [2021-10-29 00:03:39,022 INFO L226 Difference]: Without dead ends: 503 [2021-10-29 00:03:39,023 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-29 00:03:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2021-10-29 00:03:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2021-10-29 00:03:39,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.638) internal successors, (819), 500 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 819 transitions. [2021-10-29 00:03:39,044 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 819 transitions. Word has length 21 [2021-10-29 00:03:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,046 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 819 transitions. [2021-10-29 00:03:39,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 819 transitions. [2021-10-29 00:03:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 00:03:39,049 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,049 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] [2021-10-29 00:03:39,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 00:03:39,049 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1969853121, now seen corresponding path program 1 times [2021-10-29 00:03:39,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951697804] [2021-10-29 00:03:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:39,126 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-29 00:03:39,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:39,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951697804] [2021-10-29 00:03:39,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951697804] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:39,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:39,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:39,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533473935] [2021-10-29 00:03:39,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:39,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:39,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:39,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:39,129 INFO L87 Difference]: Start difference. First operand 501 states and 819 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,153 INFO L93 Difference]: Finished difference Result 905 states and 1501 transitions. [2021-10-29 00:03:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-29 00:03:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,159 INFO L225 Difference]: With dead ends: 905 [2021-10-29 00:03:39,160 INFO L226 Difference]: Without dead ends: 903 [2021-10-29 00:03:39,160 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-29 00:03:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2021-10-29 00:03:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 709. [2021-10-29 00:03:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.597457627118644) internal successors, (1131), 708 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1131 transitions. [2021-10-29 00:03:39,184 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1131 transitions. Word has length 21 [2021-10-29 00:03:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,184 INFO L470 AbstractCegarLoop]: Abstraction has 709 states and 1131 transitions. [2021-10-29 00:03:39,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1131 transitions. [2021-10-29 00:03:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 00:03:39,188 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,188 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] [2021-10-29 00:03:39,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 00:03:39,188 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1383047107, now seen corresponding path program 1 times [2021-10-29 00:03:39,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141035331] [2021-10-29 00:03:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:39,239 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-29 00:03:39,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:39,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141035331] [2021-10-29 00:03:39,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141035331] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:39,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:39,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:39,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932865211] [2021-10-29 00:03:39,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:39,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:39,243 INFO L87 Difference]: Start difference. First operand 709 states and 1131 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,281 INFO L93 Difference]: Finished difference Result 1657 states and 2653 transitions. [2021-10-29 00:03:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-29 00:03:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,289 INFO L225 Difference]: With dead ends: 1657 [2021-10-29 00:03:39,289 INFO L226 Difference]: Without dead ends: 967 [2021-10-29 00:03:39,290 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-29 00:03:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-10-29 00:03:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2021-10-29 00:03:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.579875518672199) internal successors, (1523), 964 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1523 transitions. [2021-10-29 00:03:39,340 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1523 transitions. Word has length 21 [2021-10-29 00:03:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,340 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1523 transitions. [2021-10-29 00:03:39,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1523 transitions. [2021-10-29 00:03:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 00:03:39,343 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,343 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] [2021-10-29 00:03:39,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 00:03:39,344 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 936119319, now seen corresponding path program 1 times [2021-10-29 00:03:39,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296696083] [2021-10-29 00:03:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:39,396 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-29 00:03:39,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:39,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296696083] [2021-10-29 00:03:39,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296696083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:39,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:39,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:39,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662815570] [2021-10-29 00:03:39,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:39,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:39,402 INFO L87 Difference]: Start difference. First operand 965 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,438 INFO L93 Difference]: Finished difference Result 1449 states and 2277 transitions. [2021-10-29 00:03:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 00:03:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,446 INFO L225 Difference]: With dead ends: 1449 [2021-10-29 00:03:39,446 INFO L226 Difference]: Without dead ends: 983 [2021-10-29 00:03:39,448 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-29 00:03:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-29 00:03:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2021-10-29 00:03:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.5540816326530613) internal successors, (1523), 980 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1523 transitions. [2021-10-29 00:03:39,491 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1523 transitions. Word has length 22 [2021-10-29 00:03:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,491 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1523 transitions. [2021-10-29 00:03:39,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1523 transitions. [2021-10-29 00:03:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 00:03:39,493 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,494 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] [2021-10-29 00:03:39,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 00:03:39,494 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:39,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash -74997931, now seen corresponding path program 1 times [2021-10-29 00:03:39,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606867561] [2021-10-29 00:03:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:39,531 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-29 00:03:39,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:39,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606867561] [2021-10-29 00:03:39,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606867561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:39,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:39,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:39,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63030096] [2021-10-29 00:03:39,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:39,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:39,534 INFO L87 Difference]: Start difference. First operand 981 states and 1523 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,570 INFO L93 Difference]: Finished difference Result 1737 states and 2741 transitions. [2021-10-29 00:03:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 00:03:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,582 INFO L225 Difference]: With dead ends: 1737 [2021-10-29 00:03:39,582 INFO L226 Difference]: Without dead ends: 1735 [2021-10-29 00:03:39,586 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-29 00:03:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-29 00:03:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1413. [2021-10-29 00:03:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.5092067988668556) internal successors, (2131), 1412 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2131 transitions. [2021-10-29 00:03:39,648 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2131 transitions. Word has length 22 [2021-10-29 00:03:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,649 INFO L470 AbstractCegarLoop]: Abstraction has 1413 states and 2131 transitions. [2021-10-29 00:03:39,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2131 transitions. [2021-10-29 00:03:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 00:03:39,652 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,652 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] [2021-10-29 00:03:39,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 00:03:39,653 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -661803945, now seen corresponding path program 1 times [2021-10-29 00:03:39,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76257488] [2021-10-29 00:03:39,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:39,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:39,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76257488] [2021-10-29 00:03:39,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76257488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:39,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:39,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:39,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13404404] [2021-10-29 00:03:39,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:39,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:39,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:39,694 INFO L87 Difference]: Start difference. First operand 1413 states and 2131 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,759 INFO L93 Difference]: Finished difference Result 3273 states and 4949 transitions. [2021-10-29 00:03:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 00:03:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,770 INFO L225 Difference]: With dead ends: 3273 [2021-10-29 00:03:39,770 INFO L226 Difference]: Without dead ends: 1895 [2021-10-29 00:03:39,772 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-29 00:03:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2021-10-29 00:03:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1893. [2021-10-29 00:03:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.4899577167019027) internal successors, (2819), 1892 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2819 transitions. [2021-10-29 00:03:39,872 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2819 transitions. Word has length 22 [2021-10-29 00:03:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,872 INFO L470 AbstractCegarLoop]: Abstraction has 1893 states and 2819 transitions. [2021-10-29 00:03:39,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2819 transitions. [2021-10-29 00:03:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 00:03:39,876 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,876 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] [2021-10-29 00:03:39,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 00:03:39,877 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1970246488, now seen corresponding path program 1 times [2021-10-29 00:03:39,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243498954] [2021-10-29 00:03:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:39,910 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-29 00:03:39,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:39,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243498954] [2021-10-29 00:03:39,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243498954] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:39,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:39,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:39,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053028663] [2021-10-29 00:03:39,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:39,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:39,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:39,913 INFO L87 Difference]: Start difference. First operand 1893 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,968 INFO L93 Difference]: Finished difference Result 2841 states and 4213 transitions. [2021-10-29 00:03:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-29 00:03:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,980 INFO L225 Difference]: With dead ends: 2841 [2021-10-29 00:03:39,980 INFO L226 Difference]: Without dead ends: 1927 [2021-10-29 00:03:39,984 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-29 00:03:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2021-10-29 00:03:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1925. [2021-10-29 00:03:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.4651767151767152) internal successors, (2819), 1924 states have internal predecessors, (2819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2819 transitions. [2021-10-29 00:03:40,054 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2819 transitions. Word has length 23 [2021-10-29 00:03:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:40,054 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 2819 transitions. [2021-10-29 00:03:40,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2819 transitions. [2021-10-29 00:03:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 00:03:40,058 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:40,058 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] [2021-10-29 00:03:40,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 00:03:40,058 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:40,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 959129238, now seen corresponding path program 1 times [2021-10-29 00:03:40,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:40,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939142295] [2021-10-29 00:03:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:40,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,088 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-29 00:03:40,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:40,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939142295] [2021-10-29 00:03:40,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939142295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:40,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:40,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:40,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198638151] [2021-10-29 00:03:40,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:40,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:40,092 INFO L87 Difference]: Start difference. First operand 1925 states and 2819 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:40,164 INFO L93 Difference]: Finished difference Result 3337 states and 4965 transitions. [2021-10-29 00:03:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-29 00:03:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:40,186 INFO L225 Difference]: With dead ends: 3337 [2021-10-29 00:03:40,186 INFO L226 Difference]: Without dead ends: 3335 [2021-10-29 00:03:40,188 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-29 00:03:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-10-29 00:03:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2821. [2021-10-29 00:03:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2820 states have (on average 1.4195035460992909) internal successors, (4003), 2820 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4003 transitions. [2021-10-29 00:03:40,308 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4003 transitions. Word has length 23 [2021-10-29 00:03:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:40,309 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 4003 transitions. [2021-10-29 00:03:40,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4003 transitions. [2021-10-29 00:03:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 00:03:40,314 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:40,314 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] [2021-10-29 00:03:40,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 00:03:40,314 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash 372323224, now seen corresponding path program 1 times [2021-10-29 00:03:40,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:40,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514227182] [2021-10-29 00:03:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:40,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,356 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-29 00:03:40,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:40,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514227182] [2021-10-29 00:03:40,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514227182] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:40,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:40,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:40,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986766922] [2021-10-29 00:03:40,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:40,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:40,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:40,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:40,359 INFO L87 Difference]: Start difference. First operand 2821 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:40,455 INFO L93 Difference]: Finished difference Result 6473 states and 9189 transitions. [2021-10-29 00:03:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-29 00:03:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:40,479 INFO L225 Difference]: With dead ends: 6473 [2021-10-29 00:03:40,479 INFO L226 Difference]: Without dead ends: 3719 [2021-10-29 00:03:40,483 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-29 00:03:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2021-10-29 00:03:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3717. [2021-10-29 00:03:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3717 states, 3716 states have (on average 1.3958557588805167) internal successors, (5187), 3716 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3717 states and 5187 transitions. [2021-10-29 00:03:40,638 INFO L78 Accepts]: Start accepts. Automaton has 3717 states and 5187 transitions. Word has length 23 [2021-10-29 00:03:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:40,638 INFO L470 AbstractCegarLoop]: Abstraction has 3717 states and 5187 transitions. [2021-10-29 00:03:40,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3717 states and 5187 transitions. [2021-10-29 00:03:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 00:03:40,644 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:40,644 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] [2021-10-29 00:03:40,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 00:03:40,644 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash -331549300, now seen corresponding path program 1 times [2021-10-29 00:03:40,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:40,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772648643] [2021-10-29 00:03:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:40,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,674 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-29 00:03:40,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:40,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772648643] [2021-10-29 00:03:40,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772648643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:40,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:40,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:40,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249672401] [2021-10-29 00:03:40,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:40,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:40,677 INFO L87 Difference]: Start difference. First operand 3717 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:40,776 INFO L93 Difference]: Finished difference Result 5577 states and 7749 transitions. [2021-10-29 00:03:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-29 00:03:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:40,797 INFO L225 Difference]: With dead ends: 5577 [2021-10-29 00:03:40,797 INFO L226 Difference]: Without dead ends: 3783 [2021-10-29 00:03:40,800 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-29 00:03:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2021-10-29 00:03:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2021-10-29 00:03:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3780 states have (on average 1.3722222222222222) internal successors, (5187), 3780 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5187 transitions. [2021-10-29 00:03:40,941 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5187 transitions. Word has length 24 [2021-10-29 00:03:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:40,941 INFO L470 AbstractCegarLoop]: Abstraction has 3781 states and 5187 transitions. [2021-10-29 00:03:40,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5187 transitions. [2021-10-29 00:03:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 00:03:40,949 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:40,950 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] [2021-10-29 00:03:40,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 00:03:40,950 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1342666550, now seen corresponding path program 1 times [2021-10-29 00:03:40,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:40,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747398041] [2021-10-29 00:03:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:40,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,979 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-29 00:03:40,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:40,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747398041] [2021-10-29 00:03:40,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747398041] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:40,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:40,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:40,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088156256] [2021-10-29 00:03:40,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:40,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:40,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:40,983 INFO L87 Difference]: Start difference. First operand 3781 states and 5187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:41,103 INFO L93 Difference]: Finished difference Result 6409 states and 8901 transitions. [2021-10-29 00:03:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:41,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-29 00:03:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:41,152 INFO L225 Difference]: With dead ends: 6409 [2021-10-29 00:03:41,153 INFO L226 Difference]: Without dead ends: 6407 [2021-10-29 00:03:41,155 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-29 00:03:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2021-10-29 00:03:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 5637. [2021-10-29 00:03:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.3291341376863024) internal successors, (7491), 5636 states have internal predecessors, (7491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 7491 transitions. [2021-10-29 00:03:41,383 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 7491 transitions. Word has length 24 [2021-10-29 00:03:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:41,384 INFO L470 AbstractCegarLoop]: Abstraction has 5637 states and 7491 transitions. [2021-10-29 00:03:41,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 7491 transitions. [2021-10-29 00:03:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 00:03:41,396 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:41,396 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] [2021-10-29 00:03:41,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 00:03:41,397 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:41,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1929472564, now seen corresponding path program 1 times [2021-10-29 00:03:41,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:41,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827312572] [2021-10-29 00:03:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:41,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:41,438 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-29 00:03:41,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:41,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827312572] [2021-10-29 00:03:41,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827312572] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:41,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:41,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:41,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284636103] [2021-10-29 00:03:41,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:41,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:41,441 INFO L87 Difference]: Start difference. First operand 5637 states and 7491 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:41,607 INFO L93 Difference]: Finished difference Result 12809 states and 16965 transitions. [2021-10-29 00:03:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-29 00:03:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:41,625 INFO L225 Difference]: With dead ends: 12809 [2021-10-29 00:03:41,625 INFO L226 Difference]: Without dead ends: 7303 [2021-10-29 00:03:41,633 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-29 00:03:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2021-10-29 00:03:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 7301. [2021-10-29 00:03:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7301 states, 7300 states have (on average 1.297945205479452) internal successors, (9475), 7300 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7301 states to 7301 states and 9475 transitions. [2021-10-29 00:03:41,869 INFO L78 Accepts]: Start accepts. Automaton has 7301 states and 9475 transitions. Word has length 24 [2021-10-29 00:03:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:41,869 INFO L470 AbstractCegarLoop]: Abstraction has 7301 states and 9475 transitions. [2021-10-29 00:03:41,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 7301 states and 9475 transitions. [2021-10-29 00:03:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 00:03:41,879 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:41,879 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] [2021-10-29 00:03:41,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 00:03:41,880 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1327225645, now seen corresponding path program 1 times [2021-10-29 00:03:41,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:41,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158683526] [2021-10-29 00:03:41,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:41,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:41,917 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-29 00:03:41,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:41,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158683526] [2021-10-29 00:03:41,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158683526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:41,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:41,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:41,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312651848] [2021-10-29 00:03:41,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:41,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:41,922 INFO L87 Difference]: Start difference. First operand 7301 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:42,084 INFO L93 Difference]: Finished difference Result 10953 states and 14149 transitions. [2021-10-29 00:03:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 00:03:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:42,098 INFO L225 Difference]: With dead ends: 10953 [2021-10-29 00:03:42,098 INFO L226 Difference]: Without dead ends: 7431 [2021-10-29 00:03:42,103 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-29 00:03:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2021-10-29 00:03:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7429. [2021-10-29 00:03:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 7428 states have (on average 1.2755788906838987) internal successors, (9475), 7428 states have internal predecessors, (9475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 9475 transitions. [2021-10-29 00:03:42,427 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 9475 transitions. Word has length 25 [2021-10-29 00:03:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:42,427 INFO L470 AbstractCegarLoop]: Abstraction has 7429 states and 9475 transitions. [2021-10-29 00:03:42,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 9475 transitions. [2021-10-29 00:03:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 00:03:42,437 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:42,437 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] [2021-10-29 00:03:42,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 00:03:42,438 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash 316108395, now seen corresponding path program 1 times [2021-10-29 00:03:42,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:42,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080168924] [2021-10-29 00:03:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:42,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,474 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-29 00:03:42,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:42,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080168924] [2021-10-29 00:03:42,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080168924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:42,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:42,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:42,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607660772] [2021-10-29 00:03:42,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:42,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:42,476 INFO L87 Difference]: Start difference. First operand 7429 states and 9475 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:42,673 INFO L93 Difference]: Finished difference Result 12297 states and 15749 transitions. [2021-10-29 00:03:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 00:03:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:42,702 INFO L225 Difference]: With dead ends: 12297 [2021-10-29 00:03:42,702 INFO L226 Difference]: Without dead ends: 12295 [2021-10-29 00:03:42,706 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-29 00:03:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2021-10-29 00:03:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 11269. [2021-10-29 00:03:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.238462903798367) internal successors, (13955), 11268 states have internal predecessors, (13955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 13955 transitions. [2021-10-29 00:03:43,056 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 13955 transitions. Word has length 25 [2021-10-29 00:03:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:43,056 INFO L470 AbstractCegarLoop]: Abstraction has 11269 states and 13955 transitions. [2021-10-29 00:03:43,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 13955 transitions. [2021-10-29 00:03:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 00:03:43,151 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:43,151 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] [2021-10-29 00:03:43,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 00:03:43,152 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash -270697619, now seen corresponding path program 1 times [2021-10-29 00:03:43,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:43,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064588924] [2021-10-29 00:03:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:43,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:43,176 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-29 00:03:43,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:43,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064588924] [2021-10-29 00:03:43,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064588924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:43,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:43,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:43,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545845881] [2021-10-29 00:03:43,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:43,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:43,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:43,179 INFO L87 Difference]: Start difference. First operand 11269 states and 13955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:43,444 INFO L93 Difference]: Finished difference Result 25353 states and 31109 transitions. [2021-10-29 00:03:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 00:03:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:43,481 INFO L225 Difference]: With dead ends: 25353 [2021-10-29 00:03:43,482 INFO L226 Difference]: Without dead ends: 14343 [2021-10-29 00:03:43,499 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-29 00:03:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2021-10-29 00:03:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 14341. [2021-10-29 00:03:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14340 states have (on average 1.1963040446304045) internal successors, (17155), 14340 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 17155 transitions. [2021-10-29 00:03:44,212 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 17155 transitions. Word has length 25 [2021-10-29 00:03:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:44,213 INFO L470 AbstractCegarLoop]: Abstraction has 14341 states and 17155 transitions. [2021-10-29 00:03:44,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 17155 transitions. [2021-10-29 00:03:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 00:03:44,234 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:44,234 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] [2021-10-29 00:03:44,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 00:03:44,234 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:44,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1209641729, now seen corresponding path program 1 times [2021-10-29 00:03:44,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:44,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967820164] [2021-10-29 00:03:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:44,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:44,283 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-29 00:03:44,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:44,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967820164] [2021-10-29 00:03:44,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967820164] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:44,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:44,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:44,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885015141] [2021-10-29 00:03:44,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:44,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:44,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:44,287 INFO L87 Difference]: Start difference. First operand 14341 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:44,564 INFO L93 Difference]: Finished difference Result 21513 states and 25605 transitions. [2021-10-29 00:03:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-29 00:03:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:44,602 INFO L225 Difference]: With dead ends: 21513 [2021-10-29 00:03:44,603 INFO L226 Difference]: Without dead ends: 14599 [2021-10-29 00:03:44,618 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-29 00:03:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2021-10-29 00:03:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 14597. [2021-10-29 00:03:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14597 states, 14596 states have (on average 1.175322006029049) internal successors, (17155), 14596 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14597 states to 14597 states and 17155 transitions. [2021-10-29 00:03:45,153 INFO L78 Accepts]: Start accepts. Automaton has 14597 states and 17155 transitions. Word has length 26 [2021-10-29 00:03:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:45,153 INFO L470 AbstractCegarLoop]: Abstraction has 14597 states and 17155 transitions. [2021-10-29 00:03:45,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14597 states and 17155 transitions. [2021-10-29 00:03:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 00:03:45,177 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:45,177 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] [2021-10-29 00:03:45,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 00:03:45,178 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 198524479, now seen corresponding path program 1 times [2021-10-29 00:03:45,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:45,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741631219] [2021-10-29 00:03:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:45,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,203 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-29 00:03:45,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:45,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741631219] [2021-10-29 00:03:45,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741631219] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:45,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:45,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:45,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813215712] [2021-10-29 00:03:45,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:45,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:45,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:45,209 INFO L87 Difference]: Start difference. First operand 14597 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:45,645 INFO L93 Difference]: Finished difference Result 23559 states and 27396 transitions. [2021-10-29 00:03:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-29 00:03:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:45,693 INFO L225 Difference]: With dead ends: 23559 [2021-10-29 00:03:45,694 INFO L226 Difference]: Without dead ends: 23557 [2021-10-29 00:03:45,700 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-29 00:03:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2021-10-29 00:03:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 22533. [2021-10-29 00:03:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.1476566660749157) internal successors, (25859), 22532 states have internal predecessors, (25859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 25859 transitions. [2021-10-29 00:03:46,542 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 25859 transitions. Word has length 26 [2021-10-29 00:03:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:46,542 INFO L470 AbstractCegarLoop]: Abstraction has 22533 states and 25859 transitions. [2021-10-29 00:03:46,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 25859 transitions. [2021-10-29 00:03:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 00:03:46,587 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:46,587 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] [2021-10-29 00:03:46,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 00:03:46,588 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 00:03:46,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash -388281535, now seen corresponding path program 1 times [2021-10-29 00:03:46,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:46,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096741604] [2021-10-29 00:03:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:46,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:46,616 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-29 00:03:46,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:46,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096741604] [2021-10-29 00:03:46,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096741604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:46,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:46,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:46,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359445393] [2021-10-29 00:03:46,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 00:03:46,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:46,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 00:03:46,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 00:03:46,620 INFO L87 Difference]: Start difference. First operand 22533 states and 25859 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:47,156 INFO L93 Difference]: Finished difference Result 50181 states and 56579 transitions. [2021-10-29 00:03:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 00:03:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-10-29 00:03:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:47,157 INFO L225 Difference]: With dead ends: 50181 [2021-10-29 00:03:47,157 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 00:03:47,191 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-29 00:03:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 00:03:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 00:03:47,191 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-29 00:03:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 00:03:47,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-10-29 00:03:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:47,192 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:03:47,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 00:03:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 00:03:47,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 00:03:47,196 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 00:03:47,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 00:03:47,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 00:03:47,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 00:03:47,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 00:03:47,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 00:03:47,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 00:03:47,216 INFO L857 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2021-10-29 00:03:47,217 INFO L857 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2021-10-29 00:03:47,217 INFO L857 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,218 INFO L857 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,218 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-29 00:03:47,218 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-29 00:03:47,218 INFO L857 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-10-29 00:03:47,219 INFO L857 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2021-10-29 00:03:47,219 INFO L860 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2021-10-29 00:03:47,219 INFO L857 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,219 INFO L857 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,219 INFO L857 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,220 INFO L857 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,220 INFO L857 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2021-10-29 00:03:47,220 INFO L857 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,220 INFO L857 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2021-10-29 00:03:47,220 INFO L857 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,221 INFO L857 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,221 INFO L857 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,221 INFO L860 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2021-10-29 00:03:47,221 INFO L860 garLoopResultBuilder]: At program point L164(lines 6 165) the Hoare annotation is: true [2021-10-29 00:03:47,221 INFO L857 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2021-10-29 00:03:47,221 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-29 00:03:47,222 INFO L857 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2021-10-29 00:03:47,222 INFO L853 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2021-10-29 00:03:47,222 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2021-10-29 00:03:47,222 INFO L857 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,222 INFO L857 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,223 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 00:03:47,223 INFO L857 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2021-10-29 00:03:47,223 INFO L857 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2021-10-29 00:03:47,223 INFO L857 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,223 INFO L857 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,223 INFO L857 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,224 INFO L857 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,224 INFO L857 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,224 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2021-10-29 00:03:47,224 INFO L857 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,224 INFO L857 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2021-10-29 00:03:47,224 INFO L857 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2021-10-29 00:03:47,228 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] [2021-10-29 00:03:47,230 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 00:03:47,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 12:03:47 BoogieIcfgContainer [2021-10-29 00:03:47,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 00:03:47,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 00:03:47,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 00:03:47,246 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 00:03:47,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:03:37" (3/4) ... [2021-10-29 00:03:47,250 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 00:03:47,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-29 00:03:47,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-29 00:03:47,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 00:03:47,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 00:03:47,341 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-29 00:03:47,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 00:03:47,345 INFO L168 Benchmark]: Toolchain (without parser) took 11306.62 ms. Allocated memory was 111.1 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 77.7 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 273.4 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,345 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 111.1 MB. Free memory is still 65.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:03:47,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.46 ms. Allocated memory was 111.1 MB in the beginning and 134.2 MB in the end (delta: 23.1 MB). Free memory was 77.5 MB in the beginning and 106.9 MB in the end (delta: -29.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 134.2 MB. Free memory was 106.9 MB in the beginning and 105.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,347 INFO L168 Benchmark]: Boogie Preprocessor took 28.55 ms. Allocated memory is still 134.2 MB. Free memory was 105.1 MB in the beginning and 103.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,348 INFO L168 Benchmark]: RCFGBuilder took 562.24 ms. Allocated memory is still 134.2 MB. Free memory was 103.5 MB in the beginning and 91.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,348 INFO L168 Benchmark]: TraceAbstraction took 10173.12 ms. Allocated memory was 134.2 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 90.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 261.8 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,349 INFO L168 Benchmark]: Witness Printer took 96.80 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 00:03:47,352 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.32 ms. Allocated memory is still 111.1 MB. Free memory is still 65.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 384.46 ms. Allocated memory was 111.1 MB in the beginning and 134.2 MB in the end (delta: 23.1 MB). Free memory was 77.5 MB in the beginning and 106.9 MB in the end (delta: -29.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.31 ms. Allocated memory is still 134.2 MB. Free memory was 106.9 MB in the beginning and 105.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.55 ms. Allocated memory is still 134.2 MB. Free memory was 105.1 MB in the beginning and 103.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 562.24 ms. Allocated memory is still 134.2 MB. Free memory was 103.5 MB in the beginning and 91.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10173.12 ms. Allocated memory was 134.2 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 90.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 261.8 MB. Max. memory is 16.1 GB. * Witness Printer took 96.80 ms. Allocated memory is still 2.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 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: 163]: 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2304 SDtfs, 1149 SDslu, 1533 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22533occurred in iteration=27, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1033 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 1240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-29 00:03:47,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b5879ac-09b3-443b-989a-c4b414ecdc20/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...