./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.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_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg --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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:19:50,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:19:50,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:19:50,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:19:50,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:19:50,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:19:50,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:19:50,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:19:50,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:19:50,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:19:50,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:19:50,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:19:50,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:19:50,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:19:50,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:19:50,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:19:50,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:19:50,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:19:50,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:19:50,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:19:50,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:19:50,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:19:50,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:19:50,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:19:50,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:19:50,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:19:50,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:19:50,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:19:50,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:19:50,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:19:50,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:19:50,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:19:50,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:19:50,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:19:50,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:19:50,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:19:50,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:19:50,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:19:50,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:19:50,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:19:50,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:19:50,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:19:50,603 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:19:50,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:19:50,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:19:50,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:19:50,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:19:50,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:19:50,608 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:19:50,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:19:50,608 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:19:50,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:19:50,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:19:50,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:19:50,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:19:50,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:19:50,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:19:50,612 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:19:50,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:19:50,612 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:19:50,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:19:50,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:19:50,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:19:50,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:19:50,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:19:50,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:19:50,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:19:50,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:19:50,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:19:50,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:19:50,615 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:19:50,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:19:50,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:19:50,616 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:19:50,617 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_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/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_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2021-10-28 09:19:50,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:19:50,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:19:50,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:19:50,985 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:19:50,986 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:19:50,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/locks/test_locks_9.c [2021-10-28 09:19:51,080 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/data/d72f6ed89/56b93cf7296a4baca88169529693b69a/FLAG97cbb3185 [2021-10-28 09:19:51,739 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:19:51,744 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/sv-benchmarks/c/locks/test_locks_9.c [2021-10-28 09:19:51,761 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/data/d72f6ed89/56b93cf7296a4baca88169529693b69a/FLAG97cbb3185 [2021-10-28 09:19:52,079 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/data/d72f6ed89/56b93cf7296a4baca88169529693b69a [2021-10-28 09:19:52,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:19:52,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:19:52,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:19:52,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:19:52,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:19:52,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd85970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52, skipping insertion in model container [2021-10-28 09:19:52,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:19:52,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:19:52,405 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_aee86b81-1b0f-44df-a81f-b0b40c3c364e/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-10-28 09:19:52,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:19:52,429 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:19:52,475 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_aee86b81-1b0f-44df-a81f-b0b40c3c364e/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-10-28 09:19:52,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:19:52,512 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:19:52,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52 WrapperNode [2021-10-28 09:19:52,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:19:52,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:19:52,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:19:52,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:19:52,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:19:52,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:19:52,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:19:52,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:19:52,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:19:52,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:19:52,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:19:52,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:19:52,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (1/1) ... [2021-10-28 09:19:52,634 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:19:52,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:19:52,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:19:52,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:19:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:19:52,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:19:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:19:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:19:53,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:19:53,039 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-28 09:19:53,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:19:53 BoogieIcfgContainer [2021-10-28 09:19:53,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:19:53,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:19:53,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:19:53,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:19:53,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:19:52" (1/3) ... [2021-10-28 09:19:53,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249acc24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:19:53, skipping insertion in model container [2021-10-28 09:19:53,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:19:52" (2/3) ... [2021-10-28 09:19:53,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249acc24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:19:53, skipping insertion in model container [2021-10-28 09:19:53,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:19:53" (3/3) ... [2021-10-28 09:19:53,053 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2021-10-28 09:19:53,059 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:19:53,060 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 09:19:53,162 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:19:53,184 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:19:53,185 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 09:19:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:19:53,211 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:53,212 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:53,213 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2021-10-28 09:19:53,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:53,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201770683] [2021-10-28 09:19:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:53,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:53,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:53,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201770683] [2021-10-28 09:19:53,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201770683] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:53,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:53,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:53,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416703579] [2021-10-28 09:19:53,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:53,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:53,663 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:53,748 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2021-10-28 09:19:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:53,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 09:19:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:53,766 INFO L225 Difference]: With dead ends: 77 [2021-10-28 09:19:53,766 INFO L226 Difference]: Without dead ends: 63 [2021-10-28 09:19:53,770 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-28 09:19:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2021-10-28 09:19:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2021-10-28 09:19:53,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2021-10-28 09:19:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:53,833 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2021-10-28 09:19:53,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2021-10-28 09:19:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:19:53,835 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:53,836 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:53,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:19:53,837 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2021-10-28 09:19:53,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:53,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749070645] [2021-10-28 09:19:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:53,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:53,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-28 09:19:53,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:53,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749070645] [2021-10-28 09:19:53,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749070645] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:53,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:53,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:53,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782476415] [2021-10-28 09:19:53,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:53,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,000 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:54,085 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2021-10-28 09:19:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:54,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-28 09:19:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:54,091 INFO L225 Difference]: With dead ends: 104 [2021-10-28 09:19:54,092 INFO L226 Difference]: Without dead ends: 63 [2021-10-28 09:19:54,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-28 09:19:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2021-10-28 09:19:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2021-10-28 09:19:54,131 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2021-10-28 09:19:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:54,132 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2021-10-28 09:19:54,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2021-10-28 09:19:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:19:54,154 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:54,154 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:54,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:19:54,155 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2021-10-28 09:19:54,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:54,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354251747] [2021-10-28 09:19:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:54,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:54,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:54,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354251747] [2021-10-28 09:19:54,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354251747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:54,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:54,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:54,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479506157] [2021-10-28 09:19:54,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:54,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,280 INFO L87 Difference]: Start difference. First operand 61 states and 110 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-28 09:19:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:54,300 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2021-10-28 09:19:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:54,301 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-28 09:19:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:54,302 INFO L225 Difference]: With dead ends: 96 [2021-10-28 09:19:54,302 INFO L226 Difference]: Without dead ends: 66 [2021-10-28 09:19:54,303 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-10-28 09:19:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2021-10-28 09:19:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2021-10-28 09:19:54,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2021-10-28 09:19:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:54,314 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2021-10-28 09:19:54,314 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-28 09:19:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2021-10-28 09:19:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:19:54,315 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:54,316 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:54,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:19:54,316 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2021-10-28 09:19:54,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:54,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904707] [2021-10-28 09:19:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:54,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:54,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:54,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904707] [2021-10-28 09:19:54,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904707] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:54,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:54,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:54,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678828195] [2021-10-28 09:19:54,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:54,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:54,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,393 INFO L87 Difference]: Start difference. First operand 64 states and 112 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-28 09:19:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:54,432 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2021-10-28 09:19:54,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:54,434 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-28 09:19:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:54,438 INFO L225 Difference]: With dead ends: 121 [2021-10-28 09:19:54,438 INFO L226 Difference]: Without dead ends: 119 [2021-10-28 09:19:54,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-10-28 09:19:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2021-10-28 09:19:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2021-10-28 09:19:54,472 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2021-10-28 09:19:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:54,473 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2021-10-28 09:19:54,473 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-28 09:19:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2021-10-28 09:19:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:19:54,475 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:54,476 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:19:54,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:19:54,478 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2021-10-28 09:19:54,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:54,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805729238] [2021-10-28 09:19:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:54,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:54,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:54,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805729238] [2021-10-28 09:19:54,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805729238] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:54,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:54,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:54,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821805743] [2021-10-28 09:19:54,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:54,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,569 INFO L87 Difference]: Start difference. First operand 85 states and 149 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-28 09:19:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:54,602 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2021-10-28 09:19:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:54,602 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-28 09:19:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:54,605 INFO L225 Difference]: With dead ends: 201 [2021-10-28 09:19:54,605 INFO L226 Difference]: Without dead ends: 121 [2021-10-28 09:19:54,607 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-28 09:19:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-10-28 09:19:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2021-10-28 09:19:54,635 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2021-10-28 09:19:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:54,635 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2021-10-28 09:19:54,635 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-28 09:19:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2021-10-28 09:19:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:19:54,637 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:54,638 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-28 09:19:54,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:19:54,638 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2021-10-28 09:19:54,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:54,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133298565] [2021-10-28 09:19:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:54,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:54,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:54,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133298565] [2021-10-28 09:19:54,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133298565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:54,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:54,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:54,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438546633] [2021-10-28 09:19:54,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:54,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:54,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,739 INFO L87 Difference]: Start difference. First operand 119 states and 207 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-28 09:19:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:54,768 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2021-10-28 09:19:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:54,769 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-28 09:19:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:54,770 INFO L225 Difference]: With dead ends: 180 [2021-10-28 09:19:54,770 INFO L226 Difference]: Without dead ends: 123 [2021-10-28 09:19:54,771 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-10-28 09:19:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2021-10-28 09:19:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2021-10-28 09:19:54,780 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2021-10-28 09:19:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:54,781 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2021-10-28 09:19:54,781 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-28 09:19:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2021-10-28 09:19:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:19:54,783 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:54,783 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-28 09:19:54,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:19:54,783 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2021-10-28 09:19:54,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:54,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225741522] [2021-10-28 09:19:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:54,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:54,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:54,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225741522] [2021-10-28 09:19:54,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225741522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:54,869 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:54,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:54,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987552286] [2021-10-28 09:19:54,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:54,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:54,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,873 INFO L87 Difference]: Start difference. First operand 121 states and 207 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-28 09:19:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:54,913 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2021-10-28 09:19:54,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:54,918 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-28 09:19:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:54,920 INFO L225 Difference]: With dead ends: 345 [2021-10-28 09:19:54,920 INFO L226 Difference]: Without dead ends: 231 [2021-10-28 09:19:54,922 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-28 09:19:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2021-10-28 09:19:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2021-10-28 09:19:54,949 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2021-10-28 09:19:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:54,949 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2021-10-28 09:19:54,949 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-28 09:19:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2021-10-28 09:19:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-28 09:19:54,952 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:54,952 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-28 09:19:54,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:19:54,952 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2021-10-28 09:19:54,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:54,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455384005] [2021-10-28 09:19:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:54,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455384005] [2021-10-28 09:19:55,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455384005] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020596914] [2021-10-28 09:19:55,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,029 INFO L87 Difference]: Start difference. First operand 229 states and 387 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-28 09:19:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,065 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2021-10-28 09:19:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,065 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-28 09:19:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,069 INFO L225 Difference]: With dead ends: 289 [2021-10-28 09:19:55,069 INFO L226 Difference]: Without dead ends: 287 [2021-10-28 09:19:55,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-28 09:19:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2021-10-28 09:19:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2021-10-28 09:19:55,098 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2021-10-28 09:19:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,098 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2021-10-28 09:19:55,099 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-28 09:19:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2021-10-28 09:19:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:19:55,101 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,101 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-28 09:19:55,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:19:55,102 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2021-10-28 09:19:55,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784022506] [2021-10-28 09:19:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784022506] [2021-10-28 09:19:55,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784022506] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538309297] [2021-10-28 09:19:55,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,184 INFO L87 Difference]: Start difference. First operand 229 states and 383 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-28 09:19:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,218 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2021-10-28 09:19:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,219 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-28 09:19:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,224 INFO L225 Difference]: With dead ends: 421 [2021-10-28 09:19:55,225 INFO L226 Difference]: Without dead ends: 419 [2021-10-28 09:19:55,229 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-10-28 09:19:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2021-10-28 09:19:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2021-10-28 09:19:55,259 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2021-10-28 09:19:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,260 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2021-10-28 09:19:55,260 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-28 09:19:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2021-10-28 09:19:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:19:55,275 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,276 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-28 09:19:55,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:19:55,276 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2021-10-28 09:19:55,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647483967] [2021-10-28 09:19:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647483967] [2021-10-28 09:19:55,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647483967] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578730956] [2021-10-28 09:19:55,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,310 INFO L87 Difference]: Start difference. First operand 321 states and 527 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-28 09:19:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,332 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2021-10-28 09:19:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,333 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-28 09:19:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,337 INFO L225 Difference]: With dead ends: 757 [2021-10-28 09:19:55,337 INFO L226 Difference]: Without dead ends: 443 [2021-10-28 09:19:55,339 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-10-28 09:19:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2021-10-28 09:19:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2021-10-28 09:19:55,359 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2021-10-28 09:19:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,359 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2021-10-28 09:19:55,360 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-28 09:19:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2021-10-28 09:19:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:19:55,362 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,362 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-28 09:19:55,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:19:55,363 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2021-10-28 09:19:55,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72498573] [2021-10-28 09:19:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72498573] [2021-10-28 09:19:55,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72498573] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092723249] [2021-10-28 09:19:55,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,395 INFO L87 Difference]: Start difference. First operand 441 states and 715 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-28 09:19:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,418 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2021-10-28 09:19:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,418 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-28 09:19:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,423 INFO L225 Difference]: With dead ends: 669 [2021-10-28 09:19:55,423 INFO L226 Difference]: Without dead ends: 455 [2021-10-28 09:19:55,424 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2021-10-28 09:19:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2021-10-28 09:19:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2021-10-28 09:19:55,447 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2021-10-28 09:19:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,447 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2021-10-28 09:19:55,448 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-28 09:19:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2021-10-28 09:19:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:19:55,449 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,450 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-28 09:19:55,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:19:55,450 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2021-10-28 09:19:55,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267765395] [2021-10-28 09:19:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267765395] [2021-10-28 09:19:55,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267765395] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171494730] [2021-10-28 09:19:55,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,517 INFO L87 Difference]: Start difference. First operand 453 states and 723 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-28 09:19:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,546 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2021-10-28 09:19:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,546 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-28 09:19:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,557 INFO L225 Difference]: With dead ends: 809 [2021-10-28 09:19:55,557 INFO L226 Difference]: Without dead ends: 807 [2021-10-28 09:19:55,558 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-28 09:19:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2021-10-28 09:19:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2021-10-28 09:19:55,586 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2021-10-28 09:19:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,587 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2021-10-28 09:19:55,590 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-28 09:19:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2021-10-28 09:19:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:19:55,593 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,593 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-28 09:19:55,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:19:55,594 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2021-10-28 09:19:55,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308132752] [2021-10-28 09:19:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308132752] [2021-10-28 09:19:55,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308132752] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551552180] [2021-10-28 09:19:55,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,641 INFO L87 Difference]: Start difference. First operand 645 states and 1003 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-28 09:19:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,708 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2021-10-28 09:19:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,709 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-28 09:19:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,715 INFO L225 Difference]: With dead ends: 1497 [2021-10-28 09:19:55,716 INFO L226 Difference]: Without dead ends: 871 [2021-10-28 09:19:55,717 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-28 09:19:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2021-10-28 09:19:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2021-10-28 09:19:55,773 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2021-10-28 09:19:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,773 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2021-10-28 09:19:55,773 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-28 09:19:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2021-10-28 09:19:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:19:55,776 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,776 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-28 09:19:55,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:19:55,776 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2021-10-28 09:19:55,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864633496] [2021-10-28 09:19:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864633496] [2021-10-28 09:19:55,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864633496] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347889056] [2021-10-28 09:19:55,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,813 INFO L87 Difference]: Start difference. First operand 869 states and 1331 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-28 09:19:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:55,851 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2021-10-28 09:19:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:55,851 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-28 09:19:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:55,858 INFO L225 Difference]: With dead ends: 1305 [2021-10-28 09:19:55,859 INFO L226 Difference]: Without dead ends: 887 [2021-10-28 09:19:55,860 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-10-28 09:19:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2021-10-28 09:19:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2021-10-28 09:19:55,902 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2021-10-28 09:19:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:55,902 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2021-10-28 09:19:55,903 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-28 09:19:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2021-10-28 09:19:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:19:55,905 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:55,905 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-28 09:19:55,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:19:55,906 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2021-10-28 09:19:55,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:55,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969342122] [2021-10-28 09:19:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:55,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:55,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:55,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969342122] [2021-10-28 09:19:55,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969342122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:55,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:55,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:55,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663178614] [2021-10-28 09:19:55,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:55,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:55,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:55,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:55,963 INFO L87 Difference]: Start difference. First operand 885 states and 1331 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-28 09:19:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:56,006 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2021-10-28 09:19:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:56,006 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-28 09:19:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:56,018 INFO L225 Difference]: With dead ends: 1545 [2021-10-28 09:19:56,019 INFO L226 Difference]: Without dead ends: 1543 [2021-10-28 09:19:56,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-10-28 09:19:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2021-10-28 09:19:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2021-10-28 09:19:56,073 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2021-10-28 09:19:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:56,074 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2021-10-28 09:19:56,074 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-28 09:19:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2021-10-28 09:19:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-28 09:19:56,077 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:56,078 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-28 09:19:56,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:19:56,079 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2021-10-28 09:19:56,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:56,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215938854] [2021-10-28 09:19:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:56,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:56,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:56,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215938854] [2021-10-28 09:19:56,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215938854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:56,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:56,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:56,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478980156] [2021-10-28 09:19:56,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:56,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:56,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,135 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 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-28 09:19:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:56,182 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2021-10-28 09:19:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:56,183 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-28 09:19:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:56,195 INFO L225 Difference]: With dead ends: 2953 [2021-10-28 09:19:56,195 INFO L226 Difference]: Without dead ends: 1703 [2021-10-28 09:19:56,197 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2021-10-28 09:19:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2021-10-28 09:19:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2021-10-28 09:19:56,303 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2021-10-28 09:19:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:56,303 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2021-10-28 09:19:56,304 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-28 09:19:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2021-10-28 09:19:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:19:56,307 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:56,307 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-28 09:19:56,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:19:56,307 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2021-10-28 09:19:56,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:56,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770159643] [2021-10-28 09:19:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:56,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:56,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:56,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770159643] [2021-10-28 09:19:56,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770159643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:56,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:56,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:56,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046055545] [2021-10-28 09:19:56,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:56,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:56,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:56,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,334 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 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-28 09:19:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:56,389 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2021-10-28 09:19:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:56,390 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-28 09:19:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:56,401 INFO L225 Difference]: With dead ends: 2553 [2021-10-28 09:19:56,401 INFO L226 Difference]: Without dead ends: 1735 [2021-10-28 09:19:56,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-28 09:19:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2021-10-28 09:19:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2021-10-28 09:19:56,477 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2021-10-28 09:19:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:56,478 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2021-10-28 09:19:56,478 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-28 09:19:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2021-10-28 09:19:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:19:56,482 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:56,482 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-28 09:19:56,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:19:56,482 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2021-10-28 09:19:56,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:56,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749395198] [2021-10-28 09:19:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:56,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:56,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:56,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749395198] [2021-10-28 09:19:56,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749395198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:56,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:56,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:56,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272373051] [2021-10-28 09:19:56,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:56,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,510 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 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-28 09:19:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:56,583 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2021-10-28 09:19:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:56,584 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-28 09:19:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:56,604 INFO L225 Difference]: With dead ends: 2953 [2021-10-28 09:19:56,604 INFO L226 Difference]: Without dead ends: 2951 [2021-10-28 09:19:56,606 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2021-10-28 09:19:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2021-10-28 09:19:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2021-10-28 09:19:56,725 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2021-10-28 09:19:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:56,725 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2021-10-28 09:19:56,726 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-28 09:19:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2021-10-28 09:19:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:19:56,732 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:56,733 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-28 09:19:56,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:19:56,733 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2021-10-28 09:19:56,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:56,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096099365] [2021-10-28 09:19:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:56,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:56,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:56,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096099365] [2021-10-28 09:19:56,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096099365] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:56,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:56,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:56,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844479481] [2021-10-28 09:19:56,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:56,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:56,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,787 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 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-28 09:19:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:56,894 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2021-10-28 09:19:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:56,895 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-28 09:19:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:56,916 INFO L225 Difference]: With dead ends: 5833 [2021-10-28 09:19:56,917 INFO L226 Difference]: Without dead ends: 3335 [2021-10-28 09:19:56,922 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-10-28 09:19:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2021-10-28 09:19:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2021-10-28 09:19:57,098 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2021-10-28 09:19:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:57,099 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2021-10-28 09:19:57,099 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-28 09:19:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2021-10-28 09:19:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 09:19:57,106 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:57,106 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-28 09:19:57,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:19:57,107 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2021-10-28 09:19:57,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:57,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919092584] [2021-10-28 09:19:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:57,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:57,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:57,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919092584] [2021-10-28 09:19:57,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919092584] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:57,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:57,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:57,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704270543] [2021-10-28 09:19:57,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:57,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:57,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:57,171 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 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-28 09:19:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:57,243 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2021-10-28 09:19:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:57,244 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-28 09:19:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:57,265 INFO L225 Difference]: With dead ends: 5001 [2021-10-28 09:19:57,265 INFO L226 Difference]: Without dead ends: 3399 [2021-10-28 09:19:57,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2021-10-28 09:19:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2021-10-28 09:19:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2021-10-28 09:19:57,511 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2021-10-28 09:19:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:57,512 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2021-10-28 09:19:57,512 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-28 09:19:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2021-10-28 09:19:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 09:19:57,518 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:57,518 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-28 09:19:57,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:19:57,519 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2021-10-28 09:19:57,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:57,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910374248] [2021-10-28 09:19:57,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:57,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:57,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:57,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910374248] [2021-10-28 09:19:57,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910374248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:57,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:57,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:57,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119131694] [2021-10-28 09:19:57,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:57,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:57,548 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 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-28 09:19:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:57,689 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2021-10-28 09:19:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:57,689 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-28 09:19:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:57,751 INFO L225 Difference]: With dead ends: 5641 [2021-10-28 09:19:57,751 INFO L226 Difference]: Without dead ends: 5639 [2021-10-28 09:19:57,753 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2021-10-28 09:19:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2021-10-28 09:19:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2021-10-28 09:19:57,948 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2021-10-28 09:19:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:57,948 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2021-10-28 09:19:57,949 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-28 09:19:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2021-10-28 09:19:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 09:19:57,959 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:57,959 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-28 09:19:57,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 09:19:57,960 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:57,962 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2021-10-28 09:19:57,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:57,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609324595] [2021-10-28 09:19:57,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:57,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:58,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:58,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609324595] [2021-10-28 09:19:58,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609324595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:58,006 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:58,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:58,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850968786] [2021-10-28 09:19:58,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:58,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:58,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:58,009 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 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-28 09:19:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:58,192 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2021-10-28 09:19:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:58,193 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-28 09:19:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:58,207 INFO L225 Difference]: With dead ends: 11529 [2021-10-28 09:19:58,207 INFO L226 Difference]: Without dead ends: 6535 [2021-10-28 09:19:58,215 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2021-10-28 09:19:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2021-10-28 09:19:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2021-10-28 09:19:58,522 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2021-10-28 09:19:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:58,523 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2021-10-28 09:19:58,524 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-28 09:19:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2021-10-28 09:19:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 09:19:58,536 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:58,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, 1, 1, 1, 1, 1] [2021-10-28 09:19:58,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 09:19:58,536 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2021-10-28 09:19:58,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:58,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987101066] [2021-10-28 09:19:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:58,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:58,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:58,566 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987101066] [2021-10-28 09:19:58,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987101066] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:58,567 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:58,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:58,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377222686] [2021-10-28 09:19:58,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:58,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:58,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:58,572 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 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-28 09:19:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:58,718 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2021-10-28 09:19:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:58,719 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-28 09:19:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:58,736 INFO L225 Difference]: With dead ends: 9801 [2021-10-28 09:19:58,736 INFO L226 Difference]: Without dead ends: 6663 [2021-10-28 09:19:58,743 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2021-10-28 09:19:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2021-10-28 09:19:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2021-10-28 09:19:59,034 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2021-10-28 09:19:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:59,034 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2021-10-28 09:19:59,035 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-28 09:19:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2021-10-28 09:19:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 09:19:59,046 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:59,046 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-28 09:19:59,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 09:19:59,046 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2021-10-28 09:19:59,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:59,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593681434] [2021-10-28 09:19:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:59,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:59,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:59,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593681434] [2021-10-28 09:19:59,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593681434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:59,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:59,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:59,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808795078] [2021-10-28 09:19:59,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:59,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:59,073 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 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-28 09:19:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:59,246 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2021-10-28 09:19:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:19:59,247 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-28 09:19:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:59,271 INFO L225 Difference]: With dead ends: 10759 [2021-10-28 09:19:59,271 INFO L226 Difference]: Without dead ends: 10757 [2021-10-28 09:19:59,275 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2021-10-28 09:19:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2021-10-28 09:19:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:19:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2021-10-28 09:19:59,676 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2021-10-28 09:19:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:59,676 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2021-10-28 09:19:59,677 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-28 09:19:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2021-10-28 09:19:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 09:19:59,697 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:59,697 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-28 09:19:59,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 09:19:59,698 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:19:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2021-10-28 09:19:59,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:59,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104294006] [2021-10-28 09:19:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:59,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:19:59,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:59,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104294006] [2021-10-28 09:19:59,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104294006] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:59,723 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:59,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:19:59,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848682717] [2021-10-28 09:19:59,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:19:59,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:19:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:19:59,724 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 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-28 09:20:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:20:00,033 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2021-10-28 09:20:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:20:00,034 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-28 09:20:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:20:00,034 INFO L225 Difference]: With dead ends: 22789 [2021-10-28 09:20:00,034 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:20:00,058 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:20:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:20:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:20:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:20:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:20:00,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2021-10-28 09:20:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:20:00,059 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:20:00,059 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-28 09:20:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:20:00,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:20:00,063 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:20:00,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 09:20:00,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:20:00,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:20:00,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:20:00,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:20:00,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:20:00,088 INFO L857 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,088 INFO L857 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2021-10-28 09:20:00,088 INFO L857 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2021-10-28 09:20:00,089 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:20:00,089 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:20:00,089 INFO L857 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,089 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,089 INFO L857 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,092 INFO L857 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,094 INFO L857 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2021-10-28 09:20:00,094 INFO L857 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,094 INFO L857 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2021-10-28 09:20:00,094 INFO L857 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,095 INFO L857 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2021-10-28 09:20:00,095 INFO L857 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,095 INFO L857 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,095 INFO L857 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2021-10-28 09:20:00,097 INFO L860 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2021-10-28 09:20:00,097 INFO L857 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,098 INFO L857 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2021-10-28 09:20:00,098 INFO L857 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,098 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:20:00,098 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2021-10-28 09:20:00,099 INFO L857 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2021-10-28 09:20:00,099 INFO L857 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2021-10-28 09:20:00,099 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:20:00,099 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,100 INFO L857 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,100 INFO L857 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,100 INFO L860 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2021-10-28 09:20:00,100 INFO L857 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,100 INFO L857 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,101 INFO L860 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2021-10-28 09:20:00,101 INFO L857 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2021-10-28 09:20:00,101 INFO L857 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-10-28 09:20:00,101 INFO L853 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2021-10-28 09:20:00,102 INFO L857 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2021-10-28 09:20:00,106 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] [2021-10-28 09:20:00,108 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:20:00,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:20:00 BoogieIcfgContainer [2021-10-28 09:20:00,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:20:00,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:20:00,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:20:00,123 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:20:00,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:19:53" (3/4) ... [2021-10-28 09:20:00,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:20:00,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 09:20:00,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 09:20:00,147 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:20:00,147 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:20:00,231 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:20:00,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:20:00,233 INFO L168 Benchmark]: Toolchain (without parser) took 8147.92 ms. Allocated memory was 107.0 MB in the beginning and 432.0 MB in the end (delta: 325.1 MB). Free memory was 72.0 MB in the beginning and 304.4 MB in the end (delta: -232.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,234 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 107.0 MB. Free memory was 79.8 MB in the beginning and 79.8 MB in the end (delta: 30.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:20:00,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.94 ms. Allocated memory is still 107.0 MB. Free memory was 71.7 MB in the beginning and 82.2 MB in the end (delta: -10.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.26 ms. Allocated memory is still 107.0 MB. Free memory was 82.2 MB in the beginning and 80.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,236 INFO L168 Benchmark]: Boogie Preprocessor took 56.46 ms. Allocated memory is still 107.0 MB. Free memory was 80.4 MB in the beginning and 79.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,237 INFO L168 Benchmark]: RCFGBuilder took 421.29 ms. Allocated memory is still 107.0 MB. Free memory was 79.2 MB in the beginning and 67.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,237 INFO L168 Benchmark]: TraceAbstraction took 7077.42 ms. Allocated memory was 107.0 MB in the beginning and 432.0 MB in the end (delta: 325.1 MB). Free memory was 67.1 MB in the beginning and 308.6 MB in the end (delta: -241.5 MB). Peak memory consumption was 84.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,238 INFO L168 Benchmark]: Witness Printer took 108.92 ms. Allocated memory is still 432.0 MB. Free memory was 308.6 MB in the beginning and 304.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:20:00,241 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.33 ms. Allocated memory is still 107.0 MB. Free memory was 79.8 MB in the beginning and 79.8 MB in the end (delta: 30.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 426.94 ms. Allocated memory is still 107.0 MB. Free memory was 71.7 MB in the beginning and 82.2 MB in the end (delta: -10.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.26 ms. Allocated memory is still 107.0 MB. Free memory was 82.2 MB in the beginning and 80.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.46 ms. Allocated memory is still 107.0 MB. Free memory was 80.4 MB in the beginning and 79.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 421.29 ms. Allocated memory is still 107.0 MB. Free memory was 79.2 MB in the beginning and 67.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7077.42 ms. Allocated memory was 107.0 MB in the beginning and 432.0 MB in the end (delta: 325.1 MB). Free memory was 67.1 MB in the beginning and 308.6 MB in the end (delta: -241.5 MB). Peak memory consumption was 84.0 MB. Max. memory is 16.1 GB. * Witness Printer took 108.92 ms. Allocated memory is still 432.0 MB. Free memory was 308.6 MB in the beginning and 304.4 MB in the end (delta: 4.2 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: 149]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1866 SDtfs, 922 SDslu, 1232 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 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, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-10-28 09:20:00,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aee86b81-1b0f-44df-a81f-b0b40c3c364e/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...