./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 997cd7c3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 081154e787322e3b9ad682661fd03964eab6d0d9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-997cd7c-m [2021-09-22 14:53:57,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:53:57,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:53:57,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:53:57,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:53:57,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:53:57,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:53:57,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:53:57,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:53:57,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:53:57,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:53:57,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:53:57,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:53:57,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:53:57,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:53:57,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:53:57,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:53:57,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:53:57,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:53:57,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:53:57,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:53:57,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:53:57,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:53:57,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:53:57,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:53:57,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:53:57,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:53:57,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:53:57,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:53:57,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:53:57,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:53:57,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:53:57,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:53:57,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:53:57,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:53:57,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:53:57,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:53:57,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:53:57,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:53:57,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:53:57,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:53:57,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:53:57,714 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:53:57,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:53:57,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:53:57,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:53:57,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:53:57,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:53:57,716 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:53:57,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:53:57,717 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:53:57,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:53:57,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:53:57,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:53:57,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:53:57,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:53:57,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:53:57,718 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:53:57,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:53:57,718 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:53:57,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:53:57,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:53:57,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:53:57,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:53:57,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:53:57,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:53:57,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:53:57,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:53:57,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:53:57,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:53:57,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:53:57,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:53:57,724 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 081154e787322e3b9ad682661fd03964eab6d0d9 [2021-09-22 14:53:57,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:53:58,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:53:58,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:53:58,013 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:53:58,013 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:53:58,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-09-22 14:53:58,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb96fe8d/ac6c35b49b7645b793735f26d72093b9/FLAGa880d2f4a [2021-09-22 14:53:58,506 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:53:58,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-09-22 14:53:58,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb96fe8d/ac6c35b49b7645b793735f26d72093b9/FLAGa880d2f4a [2021-09-22 14:53:58,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb96fe8d/ac6c35b49b7645b793735f26d72093b9 [2021-09-22 14:53:58,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:53:58,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:53:58,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:53:58,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:53:58,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:53:58,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:53:58" (1/1) ... [2021-09-22 14:53:58,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1903b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:58, skipping insertion in model container [2021-09-22 14:53:58,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:53:58" (1/1) ... [2021-09-22 14:53:58,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:53:58,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:53:59,123 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-09-22 14:53:59,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:53:59,160 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:53:59,194 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-09-22 14:53:59,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:53:59,306 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:53:59,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59 WrapperNode [2021-09-22 14:53:59,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:53:59,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:53:59,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:53:59,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:53:59,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:53:59,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:53:59,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:53:59,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:53:59,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:53:59,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:53:59,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:53:59,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:53:59,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (1/1) ... [2021-09-22 14:53:59,425 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:53:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:53:59,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-22 14:53:59,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-22 14:53:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:53:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-09-22 14:53:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-09-22 14:53:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-09-22 14:53:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:53:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:53:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-09-22 14:53:59,491 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-09-22 14:53:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:53:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:53:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:53:59,494 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:54:00,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:54:00,013 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-09-22 14:54:00,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:54:00 BoogieIcfgContainer [2021-09-22 14:54:00,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:54:00,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:54:00,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:54:00,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:54:00,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:53:58" (1/3) ... [2021-09-22 14:54:00,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:54:00, skipping insertion in model container [2021-09-22 14:54:00,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:53:59" (2/3) ... [2021-09-22 14:54:00,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:54:00, skipping insertion in model container [2021-09-22 14:54:00,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:54:00" (3/3) ... [2021-09-22 14:54:00,021 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-09-22 14:54:00,025 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:54:00,025 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:54:00,026 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-09-22 14:54:00,026 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:54:00,060 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,060 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,061 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,061 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,062 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,063 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,064 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,065 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,066 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,067 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,076 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,077 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,077 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,077 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,077 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,077 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,078 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,079 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,079 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,079 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,079 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,079 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,080 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,081 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,082 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,082 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,082 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,083 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,083 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,083 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,084 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,085 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,085 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,085 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,085 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,086 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,086 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,088 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,088 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,089 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,089 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,090 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,090 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,090 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,090 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,090 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,094 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,095 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,096 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,097 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,098 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,099 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,099 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,099 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,099 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,101 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,101 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,101 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,101 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,102 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,106 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,107 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,108 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,108 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,108 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,108 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:54:00,114 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-09-22 14:54:00,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:54:00,153 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-22 14:54:00,154 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-09-22 14:54:00,169 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:54:00,176 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 169 transitions, 354 flow [2021-09-22 14:54:00,179 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 169 transitions, 354 flow [2021-09-22 14:54:00,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 354 flow [2021-09-22 14:54:00,256 INFO L129 PetriNetUnfolder]: 10/205 cut-off events. [2021-09-22 14:54:00,256 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-09-22 14:54:00,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 205 events. 10/205 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2021-09-22 14:54:00,264 INFO L116 LiptonReduction]: Number of co-enabled transitions 2996 [2021-09-22 14:54:55,080 INFO L131 LiptonReduction]: Checked pairs total: 6296 [2021-09-22 14:54:55,081 INFO L133 LiptonReduction]: Total number of compositions: 191 [2021-09-22 14:54:55,096 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 35 transitions, 86 flow [2021-09-22 14:54:55,128 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-09-22 14:54:55,133 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:55,134 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-09-22 14:54:55,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2021-09-22 14:54:55,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:55,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973030062] [2021-09-22 14:54:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:55,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:55,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:55,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973030062] [2021-09-22 14:54:55,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973030062] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:55,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:55,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-09-22 14:54:55,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226181042] [2021-09-22 14:54:55,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-22 14:54:55,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-22 14:54:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-22 14:54:55,321 INFO L87 Difference]: Start difference. First operand has 368 states, 358 states have (on average 2.5083798882681565) internal successors, (898), 367 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:55,347 INFO L93 Difference]: Finished difference Result 366 states and 896 transitions. [2021-09-22 14:54:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-22 14:54:55,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2021-09-22 14:54:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:55,357 INFO L225 Difference]: With dead ends: 366 [2021-09-22 14:54:55,357 INFO L226 Difference]: Without dead ends: 329 [2021-09-22 14:54:55,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-22 14:54:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-09-22 14:54:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-09-22 14:54:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 323 states have (on average 2.473684210526316) internal successors, (799), 328 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 799 transitions. [2021-09-22 14:54:55,404 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 799 transitions. Word has length 1 [2021-09-22 14:54:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:55,404 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 799 transitions. [2021-09-22 14:54:55,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 799 transitions. [2021-09-22 14:54:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-09-22 14:54:55,405 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:55,405 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-09-22 14:54:55,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:54:55,406 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash 583278121, now seen corresponding path program 1 times [2021-09-22 14:54:55,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:55,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541465049] [2021-09-22 14:54:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:55,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:55,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:55,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541465049] [2021-09-22 14:54:55,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541465049] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:55,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:55,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:54:55,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095547537] [2021-09-22 14:54:55,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:54:55,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:54:55,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:54:55,570 INFO L87 Difference]: Start difference. First operand 329 states and 799 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:55,683 INFO L93 Difference]: Finished difference Result 484 states and 1174 transitions. [2021-09-22 14:54:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:54:55,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-09-22 14:54:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:55,688 INFO L225 Difference]: With dead ends: 484 [2021-09-22 14:54:55,689 INFO L226 Difference]: Without dead ends: 484 [2021-09-22 14:54:55,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:54:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-09-22 14:54:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 420. [2021-09-22 14:54:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 2.5012048192771084) internal successors, (1038), 419 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1038 transitions. [2021-09-22 14:54:55,723 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1038 transitions. Word has length 5 [2021-09-22 14:54:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:55,724 INFO L470 AbstractCegarLoop]: Abstraction has 420 states and 1038 transitions. [2021-09-22 14:54:55,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1038 transitions. [2021-09-22 14:54:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-09-22 14:54:55,724 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:55,724 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-09-22 14:54:55,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:54:55,725 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash 583278192, now seen corresponding path program 1 times [2021-09-22 14:54:55,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:55,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168194200] [2021-09-22 14:54:55,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:55,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:55,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:55,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168194200] [2021-09-22 14:54:55,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168194200] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:55,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:55,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:54:55,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084972477] [2021-09-22 14:54:55,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:54:55,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:55,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:54:55,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:54:55,772 INFO L87 Difference]: Start difference. First operand 420 states and 1038 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:55,826 INFO L93 Difference]: Finished difference Result 543 states and 1297 transitions. [2021-09-22 14:54:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:54:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-09-22 14:54:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:55,829 INFO L225 Difference]: With dead ends: 543 [2021-09-22 14:54:55,829 INFO L226 Difference]: Without dead ends: 527 [2021-09-22 14:54:55,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:54:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-09-22 14:54:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 495. [2021-09-22 14:54:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 491 states have (on average 2.476578411405295) internal successors, (1216), 494 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1216 transitions. [2021-09-22 14:54:55,841 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1216 transitions. Word has length 5 [2021-09-22 14:54:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:55,841 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1216 transitions. [2021-09-22 14:54:55,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1216 transitions. [2021-09-22 14:54:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:54:55,842 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:55,842 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:54:55,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:54:55,843 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash -987483982, now seen corresponding path program 1 times [2021-09-22 14:54:55,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:55,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205407317] [2021-09-22 14:54:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:55,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:55,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:55,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205407317] [2021-09-22 14:54:55,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205407317] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:55,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:55,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:54:55,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8720751] [2021-09-22 14:54:55,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:54:55,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:54:55,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:54:55,878 INFO L87 Difference]: Start difference. First operand 495 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:55,889 INFO L93 Difference]: Finished difference Result 143 states and 312 transitions. [2021-09-22 14:54:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:54:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-22 14:54:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:55,890 INFO L225 Difference]: With dead ends: 143 [2021-09-22 14:54:55,890 INFO L226 Difference]: Without dead ends: 143 [2021-09-22 14:54:55,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:54:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-09-22 14:54:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-09-22 14:54:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 141 states have (on average 2.2127659574468086) internal successors, (312), 142 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 312 transitions. [2021-09-22 14:54:55,899 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 312 transitions. Word has length 11 [2021-09-22 14:54:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:55,899 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 312 transitions. [2021-09-22 14:54:55,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 312 transitions. [2021-09-22 14:54:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:54:55,900 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:55,900 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:54:55,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:54:55,901 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash -229818472, now seen corresponding path program 1 times [2021-09-22 14:54:55,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:55,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334261578] [2021-09-22 14:54:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:55,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:56,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:56,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334261578] [2021-09-22 14:54:56,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334261578] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:56,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:56,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:54:56,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28519721] [2021-09-22 14:54:56,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:54:56,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:54:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:54:56,644 INFO L87 Difference]: Start difference. First operand 143 states and 312 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:54:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:57,684 INFO L93 Difference]: Finished difference Result 236 states and 476 transitions. [2021-09-22 14:54:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-22 14:54:57,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:54:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:57,686 INFO L225 Difference]: With dead ends: 236 [2021-09-22 14:54:57,686 INFO L226 Difference]: Without dead ends: 236 [2021-09-22 14:54:57,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 731.5ms TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-09-22 14:54:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-09-22 14:54:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 162. [2021-09-22 14:54:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 2.11875) internal successors, (339), 161 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 339 transitions. [2021-09-22 14:54:57,691 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 339 transitions. Word has length 21 [2021-09-22 14:54:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:57,691 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 339 transitions. [2021-09-22 14:54:57,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:54:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 339 transitions. [2021-09-22 14:54:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:54:57,692 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:57,692 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:54:57,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:54:57,695 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:57,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash -229818501, now seen corresponding path program 1 times [2021-09-22 14:54:57,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:57,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958086812] [2021-09-22 14:54:57,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:57,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:57,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:57,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958086812] [2021-09-22 14:54:57,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958086812] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:57,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:57,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:54:57,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067401556] [2021-09-22 14:54:57,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:54:57,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:54:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:54:57,956 INFO L87 Difference]: Start difference. First operand 162 states and 339 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:54:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:58,154 INFO L93 Difference]: Finished difference Result 226 states and 444 transitions. [2021-09-22 14:54:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:54:58,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:54:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:58,158 INFO L225 Difference]: With dead ends: 226 [2021-09-22 14:54:58,158 INFO L226 Difference]: Without dead ends: 207 [2021-09-22 14:54:58,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 119.7ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:54:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-09-22 14:54:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 164. [2021-09-22 14:54:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.111111111111111) internal successors, (342), 163 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 342 transitions. [2021-09-22 14:54:58,161 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 342 transitions. Word has length 21 [2021-09-22 14:54:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:58,162 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 342 transitions. [2021-09-22 14:54:58,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:54:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 342 transitions. [2021-09-22 14:54:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:54:58,163 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:58,163 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:54:58,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:54:58,163 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:58,163 INFO L82 PathProgramCache]: Analyzing trace with hash 538676892, now seen corresponding path program 2 times [2021-09-22 14:54:58,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:58,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048310881] [2021-09-22 14:54:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:58,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:58,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:58,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048310881] [2021-09-22 14:54:58,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048310881] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:58,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:58,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:54:58,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064978288] [2021-09-22 14:54:58,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:54:58,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:54:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:54:58,787 INFO L87 Difference]: Start difference. First operand 164 states and 342 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:54:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:54:59,706 INFO L93 Difference]: Finished difference Result 256 states and 520 transitions. [2021-09-22 14:54:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-22 14:54:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:54:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:54:59,707 INFO L225 Difference]: With dead ends: 256 [2021-09-22 14:54:59,707 INFO L226 Difference]: Without dead ends: 256 [2021-09-22 14:54:59,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 741.8ms TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2021-09-22 14:54:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-09-22 14:54:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 189. [2021-09-22 14:54:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 187 states have (on average 2.064171122994652) internal successors, (386), 188 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:54:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 386 transitions. [2021-09-22 14:54:59,712 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 386 transitions. Word has length 21 [2021-09-22 14:54:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:54:59,712 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 386 transitions. [2021-09-22 14:54:59,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:54:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 386 transitions. [2021-09-22 14:54:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:54:59,713 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:54:59,713 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:54:59,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:54:59,714 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:54:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:54:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash 538676863, now seen corresponding path program 2 times [2021-09-22 14:54:59,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:54:59,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517332335] [2021-09-22 14:54:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:54:59,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:54:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:54:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:54:59,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:54:59,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517332335] [2021-09-22 14:54:59,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517332335] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:54:59,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:54:59,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:54:59,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894898364] [2021-09-22 14:54:59,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:54:59,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:54:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:54:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:54:59,895 INFO L87 Difference]: Start difference. First operand 189 states and 386 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:00,040 INFO L93 Difference]: Finished difference Result 292 states and 553 transitions. [2021-09-22 14:55:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:55:00,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:00,041 INFO L225 Difference]: With dead ends: 292 [2021-09-22 14:55:00,041 INFO L226 Difference]: Without dead ends: 275 [2021-09-22 14:55:00,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 105.9ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:55:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-09-22 14:55:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 181. [2021-09-22 14:55:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.0670391061452515) internal successors, (370), 180 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 370 transitions. [2021-09-22 14:55:00,045 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 370 transitions. Word has length 21 [2021-09-22 14:55:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:00,046 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 370 transitions. [2021-09-22 14:55:00,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 370 transitions. [2021-09-22 14:55:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:00,046 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:00,046 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:00,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:55:00,047 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1665260969, now seen corresponding path program 3 times [2021-09-22 14:55:00,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:00,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808651810] [2021-09-22 14:55:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:00,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:00,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:00,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808651810] [2021-09-22 14:55:00,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808651810] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:00,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:00,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:55:00,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529871057] [2021-09-22 14:55:00,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:55:00,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:00,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:55:00,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:00,238 INFO L87 Difference]: Start difference. First operand 181 states and 370 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:00,406 INFO L93 Difference]: Finished difference Result 297 states and 613 transitions. [2021-09-22 14:55:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:55:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:00,408 INFO L225 Difference]: With dead ends: 297 [2021-09-22 14:55:00,408 INFO L226 Difference]: Without dead ends: 282 [2021-09-22 14:55:00,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 109.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:55:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-09-22 14:55:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 182. [2021-09-22 14:55:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 2.1277777777777778) internal successors, (383), 181 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-09-22 14:55:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 383 transitions. [2021-09-22 14:55:00,412 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 383 transitions. Word has length 21 [2021-09-22 14:55:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:00,412 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 383 transitions. [2021-09-22 14:55:00,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 383 transitions. [2021-09-22 14:55:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:00,413 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:00,413 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:00,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:55:00,413 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash -160369218, now seen corresponding path program 3 times [2021-09-22 14:55:00,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:00,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462887006] [2021-09-22 14:55:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:00,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:00,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:00,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462887006] [2021-09-22 14:55:00,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462887006] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:00,963 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:00,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:00,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839540449] [2021-09-22 14:55:00,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:00,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:00,964 INFO L87 Difference]: Start difference. First operand 182 states and 383 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:02,029 INFO L93 Difference]: Finished difference Result 268 states and 547 transitions. [2021-09-22 14:55:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-09-22 14:55:02,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:02,031 INFO L225 Difference]: With dead ends: 268 [2021-09-22 14:55:02,031 INFO L226 Difference]: Without dead ends: 255 [2021-09-22 14:55:02,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 792.9ms TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2021-09-22 14:55:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-09-22 14:55:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 186. [2021-09-22 14:55:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.125) internal successors, (391), 185 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 391 transitions. [2021-09-22 14:55:02,035 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 391 transitions. Word has length 21 [2021-09-22 14:55:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:02,035 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 391 transitions. [2021-09-22 14:55:02,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 391 transitions. [2021-09-22 14:55:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:02,036 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:02,036 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:02,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:55:02,037 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash -385945758, now seen corresponding path program 4 times [2021-09-22 14:55:02,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:02,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790544482] [2021-09-22 14:55:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:02,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:02,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:02,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790544482] [2021-09-22 14:55:02,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790544482] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:02,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:02,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:02,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453431858] [2021-09-22 14:55:02,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:02,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:02,497 INFO L87 Difference]: Start difference. First operand 186 states and 391 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:03,408 INFO L93 Difference]: Finished difference Result 272 states and 551 transitions. [2021-09-22 14:55:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-09-22 14:55:03,408 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:03,409 INFO L225 Difference]: With dead ends: 272 [2021-09-22 14:55:03,409 INFO L226 Difference]: Without dead ends: 237 [2021-09-22 14:55:03,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 707.6ms TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2021-09-22 14:55:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-09-22 14:55:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2021-09-22 14:55:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 2.125) internal successors, (357), 169 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 357 transitions. [2021-09-22 14:55:03,413 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 357 transitions. Word has length 21 [2021-09-22 14:55:03,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:03,413 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 357 transitions. [2021-09-22 14:55:03,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 357 transitions. [2021-09-22 14:55:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:03,413 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:03,413 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:03,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:55:03,413 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1751979318, now seen corresponding path program 5 times [2021-09-22 14:55:03,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:03,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739185191] [2021-09-22 14:55:03,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:03,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:03,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:03,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739185191] [2021-09-22 14:55:03,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739185191] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:03,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:03,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:03,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297205964] [2021-09-22 14:55:03,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:03,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:03,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:03,909 INFO L87 Difference]: Start difference. First operand 170 states and 357 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:04,803 INFO L93 Difference]: Finished difference Result 264 states and 529 transitions. [2021-09-22 14:55:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-22 14:55:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:04,804 INFO L225 Difference]: With dead ends: 264 [2021-09-22 14:55:04,804 INFO L226 Difference]: Without dead ends: 245 [2021-09-22 14:55:04,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 700.1ms TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2021-09-22 14:55:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-09-22 14:55:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 171. [2021-09-22 14:55:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.1183431952662723) internal successors, (358), 170 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 358 transitions. [2021-09-22 14:55:04,808 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 358 transitions. Word has length 21 [2021-09-22 14:55:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:04,808 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 358 transitions. [2021-09-22 14:55:04,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 358 transitions. [2021-09-22 14:55:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:04,809 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:04,809 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:04,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:55:04,809 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1746334808, now seen corresponding path program 6 times [2021-09-22 14:55:04,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:04,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131980546] [2021-09-22 14:55:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:04,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:04,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:04,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131980546] [2021-09-22 14:55:04,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131980546] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:04,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:04,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:55:04,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433254492] [2021-09-22 14:55:04,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:55:04,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:55:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:55:04,905 INFO L87 Difference]: Start difference. First operand 171 states and 358 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:04,963 INFO L93 Difference]: Finished difference Result 195 states and 391 transitions. [2021-09-22 14:55:04,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:55:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:04,964 INFO L225 Difference]: With dead ends: 195 [2021-09-22 14:55:04,964 INFO L226 Difference]: Without dead ends: 192 [2021-09-22 14:55:04,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-09-22 14:55:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2021-09-22 14:55:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 2.066265060240964) internal successors, (343), 167 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 343 transitions. [2021-09-22 14:55:04,967 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 343 transitions. Word has length 21 [2021-09-22 14:55:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:04,967 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 343 transitions. [2021-09-22 14:55:04,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 343 transitions. [2021-09-22 14:55:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:04,968 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:04,968 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:04,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-09-22 14:55:04,968 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1157895652, now seen corresponding path program 7 times [2021-09-22 14:55:04,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:04,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622357938] [2021-09-22 14:55:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:04,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:05,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:05,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622357938] [2021-09-22 14:55:05,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622357938] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:05,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:05,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:05,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678633669] [2021-09-22 14:55:05,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:05,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:05,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:05,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:05,462 INFO L87 Difference]: Start difference. First operand 168 states and 343 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:06,072 INFO L93 Difference]: Finished difference Result 224 states and 426 transitions. [2021-09-22 14:55:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:06,073 INFO L225 Difference]: With dead ends: 224 [2021-09-22 14:55:06,073 INFO L226 Difference]: Without dead ends: 206 [2021-09-22 14:55:06,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 511.7ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-09-22 14:55:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2021-09-22 14:55:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 2.067901234567901) internal successors, (335), 163 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 335 transitions. [2021-09-22 14:55:06,077 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 335 transitions. Word has length 21 [2021-09-22 14:55:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:06,077 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 335 transitions. [2021-09-22 14:55:06,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 335 transitions. [2021-09-22 14:55:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:06,078 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:06,078 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:06,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-09-22 14:55:06,078 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 309397486, now seen corresponding path program 8 times [2021-09-22 14:55:06,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:06,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952333423] [2021-09-22 14:55:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:06,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:06,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-09-22 14:55:06,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:06,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952333423] [2021-09-22 14:55:06,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952333423] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:06,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:06,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:06,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980611884] [2021-09-22 14:55:06,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:06,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:06,566 INFO L87 Difference]: Start difference. First operand 164 states and 335 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:07,179 INFO L93 Difference]: Finished difference Result 214 states and 411 transitions. [2021-09-22 14:55:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:07,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:07,180 INFO L225 Difference]: With dead ends: 214 [2021-09-22 14:55:07,180 INFO L226 Difference]: Without dead ends: 200 [2021-09-22 14:55:07,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 470.4ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-09-22 14:55:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 159. [2021-09-22 14:55:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 2.0955414012738856) internal successors, (329), 158 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 329 transitions. [2021-09-22 14:55:07,184 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 329 transitions. Word has length 21 [2021-09-22 14:55:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:07,184 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 329 transitions. [2021-09-22 14:55:07,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 329 transitions. [2021-09-22 14:55:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:07,185 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:07,185 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:07,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-09-22 14:55:07,185 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:07,185 INFO L82 PathProgramCache]: Analyzing trace with hash -502486308, now seen corresponding path program 9 times [2021-09-22 14:55:07,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:07,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921614584] [2021-09-22 14:55:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:07,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:07,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:07,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921614584] [2021-09-22 14:55:07,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921614584] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:07,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:07,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:55:07,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180216566] [2021-09-22 14:55:07,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:55:07,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:07,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:55:07,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:55:07,304 INFO L87 Difference]: Start difference. First operand 159 states and 329 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:07,365 INFO L93 Difference]: Finished difference Result 171 states and 349 transitions. [2021-09-22 14:55:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:55:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:07,366 INFO L225 Difference]: With dead ends: 171 [2021-09-22 14:55:07,366 INFO L226 Difference]: Without dead ends: 171 [2021-09-22 14:55:07,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-09-22 14:55:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-09-22 14:55:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 2.06508875739645) internal successors, (349), 170 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 349 transitions. [2021-09-22 14:55:07,369 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 349 transitions. Word has length 21 [2021-09-22 14:55:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:07,370 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 349 transitions. [2021-09-22 14:55:07,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 349 transitions. [2021-09-22 14:55:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:07,370 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:07,370 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:07,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-09-22 14:55:07,371 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1542939810, now seen corresponding path program 10 times [2021-09-22 14:55:07,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:07,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540781528] [2021-09-22 14:55:07,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:07,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:07,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:07,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540781528] [2021-09-22 14:55:07,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540781528] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:07,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:07,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:07,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106541134] [2021-09-22 14:55:07,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:07,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:07,834 INFO L87 Difference]: Start difference. First operand 171 states and 349 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:08,476 INFO L93 Difference]: Finished difference Result 200 states and 393 transitions. [2021-09-22 14:55:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-22 14:55:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:08,478 INFO L225 Difference]: With dead ends: 200 [2021-09-22 14:55:08,478 INFO L226 Difference]: Without dead ends: 200 [2021-09-22 14:55:08,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 484.2ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-09-22 14:55:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-09-22 14:55:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 198 states have (on average 1.9848484848484849) internal successors, (393), 199 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 393 transitions. [2021-09-22 14:55:08,481 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 393 transitions. Word has length 21 [2021-09-22 14:55:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:08,481 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 393 transitions. [2021-09-22 14:55:08,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 393 transitions. [2021-09-22 14:55:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:08,482 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:08,482 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:08,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-09-22 14:55:08,482 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1542939781, now seen corresponding path program 4 times [2021-09-22 14:55:08,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:08,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650925908] [2021-09-22 14:55:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:08,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:08,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-09-22 14:55:08,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:08,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650925908] [2021-09-22 14:55:08,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650925908] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:08,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:08,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:55:08,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306110718] [2021-09-22 14:55:08,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:55:08,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:55:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:08,638 INFO L87 Difference]: Start difference. First operand 200 states and 393 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:08,800 INFO L93 Difference]: Finished difference Result 277 states and 516 transitions. [2021-09-22 14:55:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:55:08,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:08,801 INFO L225 Difference]: With dead ends: 277 [2021-09-22 14:55:08,801 INFO L226 Difference]: Without dead ends: 247 [2021-09-22 14:55:08,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 120.5ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:55:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-09-22 14:55:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 188. [2021-09-22 14:55:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.043010752688172) internal successors, (380), 187 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 380 transitions. [2021-09-22 14:55:08,805 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 380 transitions. Word has length 21 [2021-09-22 14:55:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:08,805 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 380 transitions. [2021-09-22 14:55:08,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 380 transitions. [2021-09-22 14:55:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:08,806 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:08,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:08,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-09-22 14:55:08,806 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1955977246, now seen corresponding path program 11 times [2021-09-22 14:55:08,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:08,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140174822] [2021-09-22 14:55:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:08,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:09,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:09,276 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140174822] [2021-09-22 14:55:09,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140174822] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:09,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:09,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:09,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565527269] [2021-09-22 14:55:09,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:09,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:09,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:09,277 INFO L87 Difference]: Start difference. First operand 188 states and 380 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:09,827 INFO L93 Difference]: Finished difference Result 215 states and 421 transitions. [2021-09-22 14:55:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-22 14:55:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:09,828 INFO L225 Difference]: With dead ends: 215 [2021-09-22 14:55:09,828 INFO L226 Difference]: Without dead ends: 186 [2021-09-22 14:55:09,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 500.3ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-09-22 14:55:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-09-22 14:55:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.0434782608695654) internal successors, (376), 185 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 376 transitions. [2021-09-22 14:55:09,832 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 376 transitions. Word has length 21 [2021-09-22 14:55:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:09,832 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 376 transitions. [2021-09-22 14:55:09,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 376 transitions. [2021-09-22 14:55:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:09,833 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:09,833 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:09,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-09-22 14:55:09,833 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:09,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1217238588, now seen corresponding path program 12 times [2021-09-22 14:55:09,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:09,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62927691] [2021-09-22 14:55:09,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:09,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:10,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:10,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62927691] [2021-09-22 14:55:10,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62927691] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:10,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:10,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:10,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791125372] [2021-09-22 14:55:10,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:10,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:10,356 INFO L87 Difference]: Start difference. First operand 186 states and 376 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:11,018 INFO L93 Difference]: Finished difference Result 212 states and 416 transitions. [2021-09-22 14:55:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:11,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:11,021 INFO L225 Difference]: With dead ends: 212 [2021-09-22 14:55:11,021 INFO L226 Difference]: Without dead ends: 185 [2021-09-22 14:55:11,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 571.2ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-09-22 14:55:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-09-22 14:55:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 2.0437158469945356) internal successors, (374), 184 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 374 transitions. [2021-09-22 14:55:11,024 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 374 transitions. Word has length 21 [2021-09-22 14:55:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:11,024 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 374 transitions. [2021-09-22 14:55:11,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 374 transitions. [2021-09-22 14:55:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:11,025 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:11,025 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:11,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-09-22 14:55:11,025 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash -800839378, now seen corresponding path program 13 times [2021-09-22 14:55:11,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:11,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130047696] [2021-09-22 14:55:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:11,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:11,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:11,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130047696] [2021-09-22 14:55:11,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130047696] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:11,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:11,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:11,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397847421] [2021-09-22 14:55:11,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:11,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:11,496 INFO L87 Difference]: Start difference. First operand 185 states and 374 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:12,080 INFO L93 Difference]: Finished difference Result 247 states and 473 transitions. [2021-09-22 14:55:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:12,081 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:12,082 INFO L225 Difference]: With dead ends: 247 [2021-09-22 14:55:12,082 INFO L226 Difference]: Without dead ends: 247 [2021-09-22 14:55:12,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 512.7ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-09-22 14:55:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 206. [2021-09-22 14:55:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 204 states have (on average 2.0) internal successors, (408), 205 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 408 transitions. [2021-09-22 14:55:12,086 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 408 transitions. Word has length 21 [2021-09-22 14:55:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:12,086 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 408 transitions. [2021-09-22 14:55:12,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 408 transitions. [2021-09-22 14:55:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:12,087 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:12,087 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:12,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-09-22 14:55:12,087 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash -800839407, now seen corresponding path program 5 times [2021-09-22 14:55:12,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:12,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460243586] [2021-09-22 14:55:12,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:12,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:12,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:12,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460243586] [2021-09-22 14:55:12,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460243586] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:12,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:12,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:55:12,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628076742] [2021-09-22 14:55:12,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:55:12,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:55:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:12,239 INFO L87 Difference]: Start difference. First operand 206 states and 408 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:12,404 INFO L93 Difference]: Finished difference Result 296 states and 558 transitions. [2021-09-22 14:55:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:55:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:12,406 INFO L225 Difference]: With dead ends: 296 [2021-09-22 14:55:12,406 INFO L226 Difference]: Without dead ends: 283 [2021-09-22 14:55:12,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 111.1ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:55:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-09-22 14:55:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 201. [2021-09-22 14:55:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 199 states have (on average 2.050251256281407) internal successors, (408), 200 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 408 transitions. [2021-09-22 14:55:12,409 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 408 transitions. Word has length 21 [2021-09-22 14:55:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:12,409 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 408 transitions. [2021-09-22 14:55:12,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 408 transitions. [2021-09-22 14:55:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:12,410 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:12,410 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:12,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-09-22 14:55:12,410 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash -626997040, now seen corresponding path program 14 times [2021-09-22 14:55:12,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:12,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563879513] [2021-09-22 14:55:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:12,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:12,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:12,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563879513] [2021-09-22 14:55:12,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563879513] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:12,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:12,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:12,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470078351] [2021-09-22 14:55:12,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:12,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:12,922 INFO L87 Difference]: Start difference. First operand 201 states and 408 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:13,489 INFO L93 Difference]: Finished difference Result 240 states and 474 transitions. [2021-09-22 14:55:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:13,490 INFO L225 Difference]: With dead ends: 240 [2021-09-22 14:55:13,490 INFO L226 Difference]: Without dead ends: 225 [2021-09-22 14:55:13,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 493.5ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-09-22 14:55:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2021-09-22 14:55:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.050761421319797) internal successors, (404), 198 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 404 transitions. [2021-09-22 14:55:13,494 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 404 transitions. Word has length 21 [2021-09-22 14:55:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:13,494 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 404 transitions. [2021-09-22 14:55:13,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 404 transitions. [2021-09-22 14:55:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:13,495 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:13,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:13,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-09-22 14:55:13,495 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash -295988382, now seen corresponding path program 15 times [2021-09-22 14:55:13,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:13,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400752590] [2021-09-22 14:55:13,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:13,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:13,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:13,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400752590] [2021-09-22 14:55:13,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400752590] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:13,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:13,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:13,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740880361] [2021-09-22 14:55:13,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:13,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:13,959 INFO L87 Difference]: Start difference. First operand 199 states and 404 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:14,500 INFO L93 Difference]: Finished difference Result 245 states and 478 transitions. [2021-09-22 14:55:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-22 14:55:14,500 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:14,501 INFO L225 Difference]: With dead ends: 245 [2021-09-22 14:55:14,505 INFO L226 Difference]: Without dead ends: 226 [2021-09-22 14:55:14,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 503.1ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-09-22 14:55:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2021-09-22 14:55:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 2.0046296296296298) internal successors, (433), 217 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 433 transitions. [2021-09-22 14:55:14,509 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 433 transitions. Word has length 21 [2021-09-22 14:55:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:14,509 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 433 transitions. [2021-09-22 14:55:14,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 433 transitions. [2021-09-22 14:55:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:14,510 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:14,510 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:14,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-09-22 14:55:14,511 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash 816483609, now seen corresponding path program 6 times [2021-09-22 14:55:14,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:14,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38508940] [2021-09-22 14:55:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:14,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:14,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:14,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38508940] [2021-09-22 14:55:14,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38508940] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:14,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:14,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:55:14,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048581849] [2021-09-22 14:55:14,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:55:14,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:55:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:14,676 INFO L87 Difference]: Start difference. First operand 218 states and 433 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:14,822 INFO L93 Difference]: Finished difference Result 315 states and 586 transitions. [2021-09-22 14:55:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:55:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:14,824 INFO L225 Difference]: With dead ends: 315 [2021-09-22 14:55:14,824 INFO L226 Difference]: Without dead ends: 292 [2021-09-22 14:55:14,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:55:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-09-22 14:55:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 187. [2021-09-22 14:55:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.0594594594594593) internal successors, (381), 186 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 381 transitions. [2021-09-22 14:55:14,827 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 381 transitions. Word has length 21 [2021-09-22 14:55:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:14,827 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 381 transitions. [2021-09-22 14:55:14,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-09-22 14:55:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 381 transitions. [2021-09-22 14:55:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:14,828 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:14,828 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:14,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-09-22 14:55:14,828 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -458357992, now seen corresponding path program 16 times [2021-09-22 14:55:14,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:14,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638940956] [2021-09-22 14:55:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:14,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:15,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:15,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638940956] [2021-09-22 14:55:15,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638940956] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:15,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:15,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:15,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030013206] [2021-09-22 14:55:15,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:15,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:15,328 INFO L87 Difference]: Start difference. First operand 187 states and 381 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:15,920 INFO L93 Difference]: Finished difference Result 212 states and 420 transitions. [2021-09-22 14:55:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:15,921 INFO L225 Difference]: With dead ends: 212 [2021-09-22 14:55:15,921 INFO L226 Difference]: Without dead ends: 174 [2021-09-22 14:55:15,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 516.1ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-09-22 14:55:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-09-22 14:55:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 172 states have (on average 2.0988372093023258) internal successors, (361), 173 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 361 transitions. [2021-09-22 14:55:15,924 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 361 transitions. Word has length 21 [2021-09-22 14:55:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:15,924 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 361 transitions. [2021-09-22 14:55:15,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 361 transitions. [2021-09-22 14:55:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:15,925 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:15,925 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:15,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-09-22 14:55:15,925 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1747350066, now seen corresponding path program 17 times [2021-09-22 14:55:15,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:15,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396951757] [2021-09-22 14:55:15,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:15,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:15,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:15,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396951757] [2021-09-22 14:55:15,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396951757] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:15,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:15,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:55:15,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214992375] [2021-09-22 14:55:15,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:55:15,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:55:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:55:15,999 INFO L87 Difference]: Start difference. First operand 174 states and 361 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:16,079 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2021-09-22 14:55:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:55:16,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:16,079 INFO L225 Difference]: With dead ends: 64 [2021-09-22 14:55:16,079 INFO L226 Difference]: Without dead ends: 64 [2021-09-22 14:55:16,080 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:55:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-09-22 14:55:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-09-22 14:55:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 105 transitions. [2021-09-22 14:55:16,081 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 105 transitions. Word has length 21 [2021-09-22 14:55:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:16,081 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 105 transitions. [2021-09-22 14:55:16,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-09-22 14:55:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2021-09-22 14:55:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:16,082 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:16,082 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:16,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-09-22 14:55:16,082 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1731723038, now seen corresponding path program 18 times [2021-09-22 14:55:16,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:16,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007429478] [2021-09-22 14:55:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:16,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:16,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:16,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007429478] [2021-09-22 14:55:16,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007429478] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:16,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:16,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:16,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841687933] [2021-09-22 14:55:16,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:16,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:16,519 INFO L87 Difference]: Start difference. First operand 64 states and 105 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:17,014 INFO L93 Difference]: Finished difference Result 91 states and 146 transitions. [2021-09-22 14:55:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-22 14:55:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:17,014 INFO L225 Difference]: With dead ends: 91 [2021-09-22 14:55:17,014 INFO L226 Difference]: Without dead ends: 62 [2021-09-22 14:55:17,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 475.6ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-22 14:55:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-09-22 14:55:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 61 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 101 transitions. [2021-09-22 14:55:17,016 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 101 transitions. Word has length 21 [2021-09-22 14:55:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:17,016 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 101 transitions. [2021-09-22 14:55:17,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 101 transitions. [2021-09-22 14:55:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:17,017 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:17,017 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:17,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-09-22 14:55:17,017 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1824505600, now seen corresponding path program 19 times [2021-09-22 14:55:17,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:17,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050027311] [2021-09-22 14:55:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:17,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:17,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:17,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050027311] [2021-09-22 14:55:17,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050027311] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:17,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:17,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:17,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726420441] [2021-09-22 14:55:17,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:17,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:17,493 INFO L87 Difference]: Start difference. First operand 62 states and 101 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:18,060 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2021-09-22 14:55:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:18,061 INFO L225 Difference]: With dead ends: 94 [2021-09-22 14:55:18,061 INFO L226 Difference]: Without dead ends: 67 [2021-09-22 14:55:18,061 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 496.0ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-09-22 14:55:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2021-09-22 14:55:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.6507936507936507) internal successors, (104), 63 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2021-09-22 14:55:18,062 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 21 [2021-09-22 14:55:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:18,063 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2021-09-22 14:55:18,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2021-09-22 14:55:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:18,063 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:18,063 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:18,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-09-22 14:55:18,064 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:18,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:18,064 INFO L82 PathProgramCache]: Analyzing trace with hash -193572366, now seen corresponding path program 20 times [2021-09-22 14:55:18,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:18,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405639803] [2021-09-22 14:55:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:18,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:18,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:18,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405639803] [2021-09-22 14:55:18,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405639803] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:18,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:18,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:18,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313983739] [2021-09-22 14:55:18,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:18,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:18,469 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:19,012 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2021-09-22 14:55:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:19,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:19,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:19,013 INFO L225 Difference]: With dead ends: 109 [2021-09-22 14:55:19,013 INFO L226 Difference]: Without dead ends: 96 [2021-09-22 14:55:19,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 457.0ms TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-09-22 14:55:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2021-09-22 14:55:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 73 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 122 transitions. [2021-09-22 14:55:19,015 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 122 transitions. Word has length 21 [2021-09-22 14:55:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:19,015 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 122 transitions. [2021-09-22 14:55:19,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 122 transitions. [2021-09-22 14:55:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:19,016 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:19,016 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:19,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-09-22 14:55:19,016 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:19,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:19,016 INFO L82 PathProgramCache]: Analyzing trace with hash -19730028, now seen corresponding path program 21 times [2021-09-22 14:55:19,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:19,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645382933] [2021-09-22 14:55:19,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:19,017 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:19,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:19,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645382933] [2021-09-22 14:55:19,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645382933] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:19,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:19,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:19,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175522820] [2021-09-22 14:55:19,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:19,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:19,451 INFO L87 Difference]: Start difference. First operand 74 states and 122 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:19,973 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2021-09-22 14:55:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:19,974 INFO L225 Difference]: With dead ends: 102 [2021-09-22 14:55:19,974 INFO L226 Difference]: Without dead ends: 87 [2021-09-22 14:55:19,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 459.1ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-09-22 14:55:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2021-09-22 14:55:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 71 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2021-09-22 14:55:19,975 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 21 [2021-09-22 14:55:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:19,976 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2021-09-22 14:55:19,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2021-09-22 14:55:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:19,976 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:19,976 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:19,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-09-22 14:55:19,976 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash 311278630, now seen corresponding path program 22 times [2021-09-22 14:55:19,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:19,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109344905] [2021-09-22 14:55:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:19,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:20,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:20,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109344905] [2021-09-22 14:55:20,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109344905] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:20,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:20,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:20,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312154217] [2021-09-22 14:55:20,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:20,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:20,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:20,415 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:20,938 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2021-09-22 14:55:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-22 14:55:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:20,939 INFO L225 Difference]: With dead ends: 102 [2021-09-22 14:55:20,939 INFO L226 Difference]: Without dead ends: 77 [2021-09-22 14:55:20,940 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 466.9ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-09-22 14:55:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-09-22 14:55:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2021-09-22 14:55:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 67 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-09-22 14:55:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2021-09-22 14:55:20,941 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 21 [2021-09-22 14:55:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:20,941 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2021-09-22 14:55:20,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2021-09-22 14:55:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:20,942 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:20,942 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:20,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-09-22 14:55:20,942 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:20,942 INFO L82 PathProgramCache]: Analyzing trace with hash 148909020, now seen corresponding path program 23 times [2021-09-22 14:55:20,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:20,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518782876] [2021-09-22 14:55:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:20,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:21,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:21,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518782876] [2021-09-22 14:55:21,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518782876] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:21,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:21,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:21,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363770114] [2021-09-22 14:55:21,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:21,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:21,390 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:21,923 INFO L93 Difference]: Finished difference Result 94 states and 150 transitions. [2021-09-22 14:55:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:21,923 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:21,923 INFO L225 Difference]: With dead ends: 94 [2021-09-22 14:55:21,923 INFO L226 Difference]: Without dead ends: 58 [2021-09-22 14:55:21,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 495.9ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-09-22 14:55:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-09-22 14:55:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.631578947368421) internal successors, (93), 57 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2021-09-22 14:55:21,925 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 21 [2021-09-22 14:55:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:21,925 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2021-09-22 14:55:21,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2021-09-22 14:55:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:21,925 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:21,925 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:21,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-09-22 14:55:21,926 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash -574776384, now seen corresponding path program 24 times [2021-09-22 14:55:21,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:21,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153327658] [2021-09-22 14:55:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:21,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:22,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:22,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153327658] [2021-09-22 14:55:22,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153327658] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:22,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:22,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:22,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618038478] [2021-09-22 14:55:22,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:22,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:22,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:22,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:22,349 INFO L87 Difference]: Start difference. First operand 58 states and 93 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:22,958 INFO L93 Difference]: Finished difference Result 84 states and 133 transitions. [2021-09-22 14:55:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-22 14:55:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:22,959 INFO L225 Difference]: With dead ends: 84 [2021-09-22 14:55:22,959 INFO L226 Difference]: Without dead ends: 57 [2021-09-22 14:55:22,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 535.6ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-09-22 14:55:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-09-22 14:55:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.625) internal successors, (91), 56 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2021-09-22 14:55:22,960 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 21 [2021-09-22 14:55:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:22,960 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2021-09-22 14:55:22,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2021-09-22 14:55:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:22,961 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:22,961 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:22,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-09-22 14:55:22,961 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:22,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1702112946, now seen corresponding path program 25 times [2021-09-22 14:55:22,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:22,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043674603] [2021-09-22 14:55:22,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:22,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:23,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:23,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043674603] [2021-09-22 14:55:23,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043674603] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:23,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:23,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:23,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693418049] [2021-09-22 14:55:23,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:23,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:23,372 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:23,947 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2021-09-22 14:55:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-09-22 14:55:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:23,948 INFO L225 Difference]: With dead ends: 102 [2021-09-22 14:55:23,948 INFO L226 Difference]: Without dead ends: 89 [2021-09-22 14:55:23,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 506.3ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-09-22 14:55:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-09-22 14:55:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 66 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 109 transitions. [2021-09-22 14:55:23,949 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 109 transitions. Word has length 21 [2021-09-22 14:55:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:23,949 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 109 transitions. [2021-09-22 14:55:23,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 109 transitions. [2021-09-22 14:55:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:23,950 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:23,950 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:23,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-09-22 14:55:23,950 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1875955284, now seen corresponding path program 26 times [2021-09-22 14:55:23,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:23,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586181457] [2021-09-22 14:55:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:23,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:24,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:24,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586181457] [2021-09-22 14:55:24,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586181457] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:24,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:24,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:24,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918731409] [2021-09-22 14:55:24,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:24,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:24,388 INFO L87 Difference]: Start difference. First operand 67 states and 109 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:24,917 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2021-09-22 14:55:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-22 14:55:24,917 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:24,918 INFO L225 Difference]: With dead ends: 95 [2021-09-22 14:55:24,918 INFO L226 Difference]: Without dead ends: 80 [2021-09-22 14:55:24,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 497.9ms TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-09-22 14:55:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2021-09-22 14:55:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.640625) internal successors, (105), 64 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 105 transitions. [2021-09-22 14:55:24,919 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 105 transitions. Word has length 21 [2021-09-22 14:55:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:24,920 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 105 transitions. [2021-09-22 14:55:24,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 105 transitions. [2021-09-22 14:55:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:24,920 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:24,920 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:24,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-09-22 14:55:24,920 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2088003354, now seen corresponding path program 27 times [2021-09-22 14:55:24,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:24,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348630654] [2021-09-22 14:55:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:24,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:25,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:25,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348630654] [2021-09-22 14:55:25,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348630654] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:25,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:25,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:25,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139486817] [2021-09-22 14:55:25,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:25,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:25,342 INFO L87 Difference]: Start difference. First operand 65 states and 105 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:25,891 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2021-09-22 14:55:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:25,891 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:25,892 INFO L225 Difference]: With dead ends: 95 [2021-09-22 14:55:25,892 INFO L226 Difference]: Without dead ends: 70 [2021-09-22 14:55:25,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 511.6ms TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-09-22 14:55:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-09-22 14:55:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 60 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 97 transitions. [2021-09-22 14:55:25,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 97 transitions. Word has length 21 [2021-09-22 14:55:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:25,893 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 97 transitions. [2021-09-22 14:55:25,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 97 transitions. [2021-09-22 14:55:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:25,893 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:25,893 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:25,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-09-22 14:55:25,894 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:25,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2044594332, now seen corresponding path program 28 times [2021-09-22 14:55:25,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:25,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204772760] [2021-09-22 14:55:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:25,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:26,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:26,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204772760] [2021-09-22 14:55:26,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204772760] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:26,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:26,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:26,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993074806] [2021-09-22 14:55:26,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:26,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:26,334 INFO L87 Difference]: Start difference. First operand 61 states and 97 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:26,930 INFO L93 Difference]: Finished difference Result 87 states and 137 transitions. [2021-09-22 14:55:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-22 14:55:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:26,931 INFO L225 Difference]: With dead ends: 87 [2021-09-22 14:55:26,931 INFO L226 Difference]: Without dead ends: 55 [2021-09-22 14:55:26,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 552.9ms TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-09-22 14:55:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-09-22 14:55:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 54 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 87 transitions. [2021-09-22 14:55:26,932 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 87 transitions. Word has length 21 [2021-09-22 14:55:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:26,933 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 87 transitions. [2021-09-22 14:55:26,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 87 transitions. [2021-09-22 14:55:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:26,933 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:26,933 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:26,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-09-22 14:55:26,933 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1975039054, now seen corresponding path program 29 times [2021-09-22 14:55:26,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:26,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879572657] [2021-09-22 14:55:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:26,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:27,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:27,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879572657] [2021-09-22 14:55:27,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879572657] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:27,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:27,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:27,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824396843] [2021-09-22 14:55:27,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:27,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:27,377 INFO L87 Difference]: Start difference. First operand 55 states and 87 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:27,926 INFO L93 Difference]: Finished difference Result 102 states and 162 transitions. [2021-09-22 14:55:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-09-22 14:55:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:27,927 INFO L225 Difference]: With dead ends: 102 [2021-09-22 14:55:27,927 INFO L226 Difference]: Without dead ends: 89 [2021-09-22 14:55:27,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 511.0ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-09-22 14:55:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2021-09-22 14:55:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 108 transitions. [2021-09-22 14:55:27,935 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 108 transitions. Word has length 21 [2021-09-22 14:55:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:27,935 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 108 transitions. [2021-09-22 14:55:27,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 108 transitions. [2021-09-22 14:55:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:27,935 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:27,935 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:27,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-09-22 14:55:27,935 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:27,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:27,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1801196716, now seen corresponding path program 30 times [2021-09-22 14:55:27,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:27,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770372453] [2021-09-22 14:55:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:27,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:28,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:28,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770372453] [2021-09-22 14:55:28,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770372453] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:28,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:28,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:28,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931786990] [2021-09-22 14:55:28,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:28,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:28,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:28,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:28,371 INFO L87 Difference]: Start difference. First operand 67 states and 108 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:28,913 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2021-09-22 14:55:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-22 14:55:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:28,914 INFO L225 Difference]: With dead ends: 95 [2021-09-22 14:55:28,914 INFO L226 Difference]: Without dead ends: 80 [2021-09-22 14:55:28,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 527.3ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-09-22 14:55:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2021-09-22 14:55:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.625) internal successors, (104), 64 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2021-09-22 14:55:28,916 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 21 [2021-09-22 14:55:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:28,916 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2021-09-22 14:55:28,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2021-09-22 14:55:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:28,916 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:28,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:28,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-09-22 14:55:28,916 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:28,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:28,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1470188058, now seen corresponding path program 31 times [2021-09-22 14:55:28,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:28,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369408077] [2021-09-22 14:55:28,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:28,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:29,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:29,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369408077] [2021-09-22 14:55:29,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369408077] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:29,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:29,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:29,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835373106] [2021-09-22 14:55:29,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:29,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:29,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:29,340 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:29,911 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2021-09-22 14:55:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:29,911 INFO L225 Difference]: With dead ends: 95 [2021-09-22 14:55:29,911 INFO L226 Difference]: Without dead ends: 70 [2021-09-22 14:55:29,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 520.1ms TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-09-22 14:55:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-09-22 14:55:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6) internal successors, (96), 60 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2021-09-22 14:55:29,913 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 21 [2021-09-22 14:55:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:29,913 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 96 transitions. [2021-09-22 14:55:29,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 96 transitions. [2021-09-22 14:55:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:29,914 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:29,914 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:29,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-09-22 14:55:29,914 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1632557668, now seen corresponding path program 32 times [2021-09-22 14:55:29,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:29,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345330390] [2021-09-22 14:55:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:29,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:30,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:30,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345330390] [2021-09-22 14:55:30,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345330390] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:30,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:30,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:30,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821648388] [2021-09-22 14:55:30,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:30,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:30,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:30,342 INFO L87 Difference]: Start difference. First operand 61 states and 96 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:30,958 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2021-09-22 14:55:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-22 14:55:30,958 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:30,959 INFO L225 Difference]: With dead ends: 87 [2021-09-22 14:55:30,959 INFO L226 Difference]: Without dead ends: 51 [2021-09-22 14:55:30,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 578.3ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-09-22 14:55:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-09-22 14:55:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 79 transitions. [2021-09-22 14:55:30,961 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 79 transitions. Word has length 21 [2021-09-22 14:55:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:30,961 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 79 transitions. [2021-09-22 14:55:30,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:30,961 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2021-09-22 14:55:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:30,962 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:30,962 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:30,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-09-22 14:55:30,962 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1707326496, now seen corresponding path program 33 times [2021-09-22 14:55:30,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:30,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077574342] [2021-09-22 14:55:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:30,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:31,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:31,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077574342] [2021-09-22 14:55:31,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077574342] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:31,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:31,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:31,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712210657] [2021-09-22 14:55:31,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:31,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:31,417 INFO L87 Difference]: Start difference. First operand 51 states and 79 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:31,917 INFO L93 Difference]: Finished difference Result 69 states and 102 transitions. [2021-09-22 14:55:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-22 14:55:31,917 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:31,917 INFO L225 Difference]: With dead ends: 69 [2021-09-22 14:55:31,917 INFO L226 Difference]: Without dead ends: 56 [2021-09-22 14:55:31,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 520.9ms TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-09-22 14:55:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2021-09-22 14:55:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 46 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2021-09-22 14:55:31,919 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 21 [2021-09-22 14:55:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:31,919 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2021-09-22 14:55:31,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2021-09-22 14:55:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:31,919 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:31,919 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:31,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-09-22 14:55:31,920 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1533484158, now seen corresponding path program 34 times [2021-09-22 14:55:31,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:31,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386946781] [2021-09-22 14:55:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:31,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:32,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:32,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386946781] [2021-09-22 14:55:32,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386946781] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:32,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:32,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:32,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077961181] [2021-09-22 14:55:32,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:32,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:32,368 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:32,898 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2021-09-22 14:55:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:32,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:32,898 INFO L225 Difference]: With dead ends: 64 [2021-09-22 14:55:32,898 INFO L226 Difference]: Without dead ends: 49 [2021-09-22 14:55:32,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 533.9ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-09-22 14:55:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2021-09-22 14:55:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 44 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2021-09-22 14:55:32,900 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 21 [2021-09-22 14:55:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:32,900 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2021-09-22 14:55:32,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2021-09-22 14:55:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:32,900 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:32,901 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:32,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-09-22 14:55:32,901 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1202475500, now seen corresponding path program 35 times [2021-09-22 14:55:32,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:32,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669397396] [2021-09-22 14:55:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:32,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:33,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:33,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669397396] [2021-09-22 14:55:33,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669397396] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:33,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:33,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:33,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262271397] [2021-09-22 14:55:33,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:33,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:33,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:33,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:33,364 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:33,895 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2021-09-22 14:55:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-22 14:55:33,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:33,896 INFO L225 Difference]: With dead ends: 66 [2021-09-22 14:55:33,896 INFO L226 Difference]: Without dead ends: 41 [2021-09-22 14:55:33,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 546.7ms TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2021-09-22 14:55:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-09-22 14:55:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-09-22 14:55:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.475) internal successors, (59), 40 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:55:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2021-09-22 14:55:33,897 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 21 [2021-09-22 14:55:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:33,898 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2021-09-22 14:55:33,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2021-09-22 14:55:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:55:33,898 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:55:33,898 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:55:33,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-09-22 14:55:33,898 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-09-22 14:55:33,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:55:33,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1364845110, now seen corresponding path program 36 times [2021-09-22 14:55:33,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:55:33,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336586775] [2021-09-22 14:55:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:55:33,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:55:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:55:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:55:34,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:55:34,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336586775] [2021-09-22 14:55:34,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336586775] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:55:34,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:55:34,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-09-22 14:55:34,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582838226] [2021-09-22 14:55:34,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-22 14:55:34,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:55:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-22 14:55:34,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-09-22 14:55:34,358 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:55:34,886 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2021-09-22 14:55:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-22 14:55:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:55:34,887 INFO L225 Difference]: With dead ends: 40 [2021-09-22 14:55:34,887 INFO L226 Difference]: Without dead ends: 0 [2021-09-22 14:55:34,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 586.7ms TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2021-09-22 14:55:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-22 14:55:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-22 14:55:34,887 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-09-22 14:55:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-22 14:55:34,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-09-22 14:55:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:55:34,888 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-22 14:55:34,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 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-09-22 14:55:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-22 14:55:34,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-22 14:55:34,889 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:55:34,890 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:55:34,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-09-22 14:55:34,897 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:55:34,897 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:55:34,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:55:34 BasicIcfg [2021-09-22 14:55:34,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:55:34,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:55:34,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:55:34,899 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:55:34,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:54:00" (3/4) ... [2021-09-22 14:55:34,901 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-22 14:55:34,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2021-09-22 14:55:34,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-09-22 14:55:34,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-09-22 14:55:34,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-22 14:55:34,908 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-22 14:55:34,933 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:55:34,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:55:34,934 INFO L168 Benchmark]: Toolchain (without parser) took 96376.73 ms. Allocated memory was 56.6 MB in the beginning and 232.8 MB in the end (delta: 176.2 MB). Free memory was 31.3 MB in the beginning and 74.5 MB in the end (delta: -43.2 MB). Peak memory consumption was 132.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,935 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 56.6 MB. Free memory was 38.1 MB in the beginning and 38.1 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:55:34,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.28 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.2 MB in the beginning and 43.7 MB in the end (delta: -12.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 69.2 MB. Free memory was 43.7 MB in the beginning and 40.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,936 INFO L168 Benchmark]: Boogie Preprocessor took 41.80 ms. Allocated memory is still 69.2 MB. Free memory was 40.4 MB in the beginning and 37.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,936 INFO L168 Benchmark]: RCFGBuilder took 596.47 ms. Allocated memory is still 69.2 MB. Free memory was 37.7 MB in the beginning and 32.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,936 INFO L168 Benchmark]: TraceAbstraction took 94881.17 ms. Allocated memory was 69.2 MB in the beginning and 232.8 MB in the end (delta: 163.6 MB). Free memory was 32.3 MB in the beginning and 77.7 MB in the end (delta: -45.4 MB). Peak memory consumption was 118.7 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,937 INFO L168 Benchmark]: Witness Printer took 34.93 ms. Allocated memory is still 232.8 MB. Free memory was 77.7 MB in the beginning and 74.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:55:34,938 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.16 ms. Allocated memory is still 56.6 MB. Free memory was 38.1 MB in the beginning and 38.1 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 749.28 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.2 MB in the beginning and 43.7 MB in the end (delta: -12.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.51 ms. Allocated memory is still 69.2 MB. Free memory was 43.7 MB in the beginning and 40.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.80 ms. Allocated memory is still 69.2 MB. Free memory was 40.4 MB in the beginning and 37.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 596.47 ms. Allocated memory is still 69.2 MB. Free memory was 37.7 MB in the beginning and 32.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 94881.17 ms. Allocated memory was 69.2 MB in the beginning and 232.8 MB in the end (delta: 163.6 MB). Free memory was 32.3 MB in the beginning and 77.7 MB in the end (delta: -45.4 MB). Peak memory consumption was 118.7 MB. Max. memory is 16.1 GB. * Witness Printer took 34.93 ms. Allocated memory is still 232.8 MB. Free memory was 77.7 MB in the beginning and 74.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54902.1ms, 167 PlacesBefore, 39 PlacesAfterwards, 169 TransitionsBefore, 35 TransitionsAfterwards, 2996 CoEnabledTransitionPairs, 8 FixpointIterations, 97 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 191 TotalNumberOfCompositions, 6296 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3552, positive: 3324, positive conditional: 0, positive unconditional: 3324, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2250, positive: 2187, positive conditional: 0, positive unconditional: 2187, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2250, positive: 2182, positive conditional: 0, positive unconditional: 2182, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43966, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 346, negative conditional: 0, negative unconditional: 346, unknown: 43608, unknown conditional: 0, unknown unconditional: 43608] ], Cache Queries: [ total: 3552, positive: 1137, positive conditional: 0, positive unconditional: 1137, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 2250, unknown conditional: 0, unknown unconditional: 2250] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: 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 with 1 thread instances CFG has 4 procedures, 178 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 94749.4ms, OverallIterations: 46, TraceHistogramMax: 1, EmptinessCheckTime: 22.9ms, AutomataDifference: 22113.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 54974.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 913 SDtfs, 2221 SDslu, 3721 SDs, 0 SdLazy, 13222 SolverSat, 1276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8283.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 958 GetRequests, 53 SyntacticMatches, 73 SemanticMatches, 832 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 18882.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=3, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 190.4ms AutomataMinimizationTime, 46 MinimizatonAttempts, 1266 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 79.2ms SsaConstructionTime, 711.4ms SatisfiabilityAnalysisTime, 16098.6ms InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 21662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-09-22 14:55:35,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...