./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 c6cae56774272215d3f9a2ff07aaaee025e55ac5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 21:08:53,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 21:08:53,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 21:08:53,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 21:08:53,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 21:08:53,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 21:08:53,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 21:08:53,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 21:08:53,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 21:08:53,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 21:08:53,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 21:08:53,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 21:08:53,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 21:08:53,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 21:08:53,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 21:08:53,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 21:08:53,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 21:08:53,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 21:08:53,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 21:08:53,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 21:08:53,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 21:08:53,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 21:08:53,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 21:08:53,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 21:08:53,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 21:08:53,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 21:08:53,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 21:08:53,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 21:08:53,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 21:08:53,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 21:08:53,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 21:08:53,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 21:08:53,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 21:08:53,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 21:08:53,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 21:08:53,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 21:08:53,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 21:08:53,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 21:08:53,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 21:08:53,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 21:08:53,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 21:08:53,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 21:08:53,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 21:08:53,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 21:08:53,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 21:08:53,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 21:08:53,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 21:08:53,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 21:08:53,416 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 21:08:53,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 21:08:53,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 21:08:53,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 21:08:53,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 21:08:53,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 21:08:53,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 21:08:53,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 21:08:53,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 21:08:53,420 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 21:08:53,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 21:08:53,421 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 21:08:53,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 21:08:53,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 21:08:53,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 21:08:53,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 21:08:53,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:08:53,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 21:08:53,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 21:08:53,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 21:08:53,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 21:08:53,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 21:08:53,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 21:08:53,424 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 21:08:53,424 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-2/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-2/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 -> c6cae56774272215d3f9a2ff07aaaee025e55ac5 [2021-10-05 21:08:53,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 21:08:53,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 21:08:53,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 21:08:53,943 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 21:08:53,944 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 21:08:53,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c [2021-10-05 21:08:54,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45cd63f33/90fb6e48811b40b381b23879481b93d8/FLAGf896714d3 [2021-10-05 21:08:54,854 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 21:08:54,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c [2021-10-05 21:08:54,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45cd63f33/90fb6e48811b40b381b23879481b93d8/FLAGf896714d3 [2021-10-05 21:08:55,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45cd63f33/90fb6e48811b40b381b23879481b93d8 [2021-10-05 21:08:55,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 21:08:55,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 21:08:55,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 21:08:55,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 21:08:55,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 21:08:55,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f0bf60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55, skipping insertion in model container [2021-10-05 21:08:55,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 21:08:55,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 21:08:55,476 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c[2782,2795] [2021-10-05 21:08:55,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:08:55,493 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 21:08:55,535 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/ticket-4.wvr.c[2782,2795] [2021-10-05 21:08:55,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:08:55,565 INFO L208 MainTranslator]: Completed translation [2021-10-05 21:08:55,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55 WrapperNode [2021-10-05 21:08:55,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 21:08:55,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 21:08:55,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 21:08:55,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 21:08:55,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 21:08:55,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 21:08:55,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 21:08:55,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 21:08:55,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 21:08:55,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 21:08:55,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 21:08:55,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 21:08:55,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (1/1) ... [2021-10-05 21:08:55,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:08:55,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 21:08:55,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 21:08:55,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 21:08:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 21:08:55,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 21:08:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 21:08:55,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 21:08:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 21:08:55,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 21:08:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-10-05 21:08:55,847 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-10-05 21:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 21:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 21:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 21:08:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-05 21:08:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-05 21:08:55,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 21:08:55,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 21:08:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 21:08:55,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 21:08:55,851 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 21:08:56,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 21:08:56,352 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-10-05 21:08:56,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:08:56 BoogieIcfgContainer [2021-10-05 21:08:56,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 21:08:56,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 21:08:56,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 21:08:56,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 21:08:56,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 09:08:55" (1/3) ... [2021-10-05 21:08:56,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baf926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:08:56, skipping insertion in model container [2021-10-05 21:08:56,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:08:55" (2/3) ... [2021-10-05 21:08:56,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baf926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:08:56, skipping insertion in model container [2021-10-05 21:08:56,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:08:56" (3/3) ... [2021-10-05 21:08:56,384 INFO L111 eAbstractionObserver]: Analyzing ICFG ticket-4.wvr.c [2021-10-05 21:08:56,395 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 21:08:56,396 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 21:08:56,396 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 21:08:56,396 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 21:08:56,492 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,493 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,493 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,493 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,493 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,494 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,494 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,494 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,494 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,494 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,495 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,495 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,495 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,495 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,496 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,499 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,499 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,500 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,500 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,500 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,500 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,500 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,501 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,501 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,501 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,514 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,515 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,515 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,516 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,516 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,516 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,517 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,517 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,517 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,517 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,518 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,519 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,519 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,520 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,520 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,520 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,521 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,521 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,521 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,522 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,522 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,522 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,522 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,523 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,523 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,524 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,524 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,524 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,525 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,525 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,525 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,525 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,526 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,526 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,526 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,527 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,527 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,527 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,528 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,528 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,528 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,529 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,529 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,529 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,530 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,530 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,530 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,531 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,531 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,532 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,532 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,532 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,533 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,533 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,533 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,533 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,534 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,534 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,534 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,535 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,535 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,535 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,536 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,536 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,536 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,537 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,537 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,537 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,538 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,538 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,538 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,543 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,543 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,543 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,544 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,544 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,544 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,548 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,548 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,548 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,551 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,552 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,552 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,552 WARN L313 ript$VariableManager]: TermVariabe thread4Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,553 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,553 WARN L313 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,559 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,560 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,560 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,560 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,561 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,561 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:08:56,576 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-10-05 21:08:56,635 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 21:08:56,644 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 21:08:56,645 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-05 21:08:56,666 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 21:08:56,679 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 159 transitions, 350 flow [2021-10-05 21:08:56,683 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 159 transitions, 350 flow [2021-10-05 21:08:56,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 159 transitions, 350 flow [2021-10-05 21:08:56,804 INFO L129 PetriNetUnfolder]: 6/155 cut-off events. [2021-10-05 21:08:56,805 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-10-05 21:08:56,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 155 events. 6/155 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2021-10-05 21:08:56,833 INFO L116 LiptonReduction]: Number of co-enabled transitions 3864 [2021-10-05 21:09:02,731 INFO L131 LiptonReduction]: Checked pairs total: 11383 [2021-10-05 21:09:02,732 INFO L133 LiptonReduction]: Total number of compositions: 142 [2021-10-05 21:09:02,743 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 47 transitions, 126 flow [2021-10-05 21:09:02,992 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4146 states, 4145 states have (on average 4.312665862484922) internal successors, (17876), 4145 states have internal predecessors, (17876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 4146 states, 4145 states have (on average 4.312665862484922) internal successors, (17876), 4145 states have internal predecessors, (17876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-05 21:09:03,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:03,077 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-10-05 21:09:03,077 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1665807441, now seen corresponding path program 1 times [2021-10-05 21:09:03,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:03,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351076928] [2021-10-05 21:09:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:03,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:03,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:03,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351076928] [2021-10-05 21:09:03,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351076928] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:03,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:03,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 21:09:03,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25425355] [2021-10-05 21:09:03,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 21:09:03,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 21:09:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:09:03,410 INFO L87 Difference]: Start difference. First operand has 4146 states, 4145 states have (on average 4.312665862484922) internal successors, (17876), 4145 states have internal predecessors, (17876), 0 states have call successors, (0), 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, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:03,576 INFO L93 Difference]: Finished difference Result 4146 states and 15422 transitions. [2021-10-05 21:09:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 21:09:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-05 21:09:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:03,639 INFO L225 Difference]: With dead ends: 4146 [2021-10-05 21:09:03,639 INFO L226 Difference]: Without dead ends: 4146 [2021-10-05 21:09:03,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-05 21:09:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2021-10-05 21:09:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4146. [2021-10-05 21:09:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4146 states, 4145 states have (on average 3.720627261761158) internal successors, (15422), 4145 states have internal predecessors, (15422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 15422 transitions. [2021-10-05 21:09:04,058 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 15422 transitions. Word has length 21 [2021-10-05 21:09:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:04,058 INFO L470 AbstractCegarLoop]: Abstraction has 4146 states and 15422 transitions. [2021-10-05 21:09:04,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 15422 transitions. [2021-10-05 21:09:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:04,080 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:04,081 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:04,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 21:09:04,082 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:04,083 INFO L82 PathProgramCache]: Analyzing trace with hash 465448181, now seen corresponding path program 1 times [2021-10-05 21:09:04,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:04,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953644758] [2021-10-05 21:09:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:04,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:04,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:04,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953644758] [2021-10-05 21:09:04,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953644758] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:04,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:04,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-05 21:09:04,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064002233] [2021-10-05 21:09:04,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:09:04,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:09:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:09:04,754 INFO L87 Difference]: Start difference. First operand 4146 states and 15422 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:04,986 INFO L93 Difference]: Finished difference Result 6361 states and 23267 transitions. [2021-10-05 21:09:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 21:09:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:05,058 INFO L225 Difference]: With dead ends: 6361 [2021-10-05 21:09:05,058 INFO L226 Difference]: Without dead ends: 4368 [2021-10-05 21:09:05,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:09:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2021-10-05 21:09:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4368. [2021-10-05 21:09:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4368 states, 4367 states have (on average 3.6210212960842685) internal successors, (15813), 4367 states have internal predecessors, (15813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 15813 transitions. [2021-10-05 21:09:05,470 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 15813 transitions. Word has length 38 [2021-10-05 21:09:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:05,472 INFO L470 AbstractCegarLoop]: Abstraction has 4368 states and 15813 transitions. [2021-10-05 21:09:05,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 15813 transitions. [2021-10-05 21:09:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:05,492 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:05,493 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:05,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 21:09:05,493 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:05,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1521095357, now seen corresponding path program 2 times [2021-10-05 21:09:05,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:05,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610164637] [2021-10-05 21:09:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:05,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:05,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:05,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610164637] [2021-10-05 21:09:05,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610164637] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:05,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:05,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 21:09:05,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72920976] [2021-10-05 21:09:05,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-05 21:09:05,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-05 21:09:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-05 21:09:05,688 INFO L87 Difference]: Start difference. First operand 4368 states and 15813 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:05,899 INFO L93 Difference]: Finished difference Result 4808 states and 17465 transitions. [2021-10-05 21:09:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 21:09:05,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:05,971 INFO L225 Difference]: With dead ends: 4808 [2021-10-05 21:09:05,971 INFO L226 Difference]: Without dead ends: 4808 [2021-10-05 21:09:05,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-05 21:09:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2021-10-05 21:09:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4808. [2021-10-05 21:09:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4808 states, 4807 states have (on average 3.633243187018931) internal successors, (17465), 4807 states have internal predecessors, (17465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 17465 transitions. [2021-10-05 21:09:06,255 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 17465 transitions. Word has length 38 [2021-10-05 21:09:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:06,256 INFO L470 AbstractCegarLoop]: Abstraction has 4808 states and 17465 transitions. [2021-10-05 21:09:06,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 17465 transitions. [2021-10-05 21:09:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:06,287 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:06,288 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:06,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 21:09:06,288 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash 661953761, now seen corresponding path program 3 times [2021-10-05 21:09:06,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:06,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625011335] [2021-10-05 21:09:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:06,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:06,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:06,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625011335] [2021-10-05 21:09:06,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625011335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:06,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:06,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:06,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067040518] [2021-10-05 21:09:06,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:06,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:06,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:06,525 INFO L87 Difference]: Start difference. First operand 4808 states and 17465 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:07,222 INFO L93 Difference]: Finished difference Result 7092 states and 24571 transitions. [2021-10-05 21:09:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:09:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:07,260 INFO L225 Difference]: With dead ends: 7092 [2021-10-05 21:09:07,261 INFO L226 Difference]: Without dead ends: 6226 [2021-10-05 21:09:07,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 157.2ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:09:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2021-10-05 21:09:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 5356. [2021-10-05 21:09:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5356 states, 5355 states have (on average 3.5871148459383755) internal successors, (19209), 5355 states have internal predecessors, (19209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 19209 transitions. [2021-10-05 21:09:07,617 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 19209 transitions. Word has length 38 [2021-10-05 21:09:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:07,618 INFO L470 AbstractCegarLoop]: Abstraction has 5356 states and 19209 transitions. [2021-10-05 21:09:07,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 19209 transitions. [2021-10-05 21:09:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:07,643 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:07,643 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:07,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 21:09:07,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:07,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1447149423, now seen corresponding path program 4 times [2021-10-05 21:09:07,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:07,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132438028] [2021-10-05 21:09:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:07,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:07,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:07,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132438028] [2021-10-05 21:09:07,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132438028] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:07,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:07,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:07,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020200756] [2021-10-05 21:09:07,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:07,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:07,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:07,845 INFO L87 Difference]: Start difference. First operand 5356 states and 19209 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:08,528 INFO L93 Difference]: Finished difference Result 8488 states and 28209 transitions. [2021-10-05 21:09:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:09:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:08,573 INFO L225 Difference]: With dead ends: 8488 [2021-10-05 21:09:08,574 INFO L226 Difference]: Without dead ends: 7124 [2021-10-05 21:09:08,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 142.1ms TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:09:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7124 states. [2021-10-05 21:09:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7124 to 5742. [2021-10-05 21:09:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5742 states, 5741 states have (on average 3.4915519944260582) internal successors, (20045), 5741 states have internal predecessors, (20045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 20045 transitions. [2021-10-05 21:09:08,928 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 20045 transitions. Word has length 38 [2021-10-05 21:09:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:08,929 INFO L470 AbstractCegarLoop]: Abstraction has 5742 states and 20045 transitions. [2021-10-05 21:09:08,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 20045 transitions. [2021-10-05 21:09:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:08,955 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:08,956 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:08,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 21:09:08,956 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash -219164853, now seen corresponding path program 5 times [2021-10-05 21:09:08,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:08,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238552760] [2021-10-05 21:09:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:08,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:09,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:09,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238552760] [2021-10-05 21:09:09,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238552760] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:09,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:09,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:09,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194707164] [2021-10-05 21:09:09,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:09,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:09,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:09,122 INFO L87 Difference]: Start difference. First operand 5742 states and 20045 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:09,548 INFO L93 Difference]: Finished difference Result 6252 states and 20379 transitions. [2021-10-05 21:09:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:09:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:09,582 INFO L225 Difference]: With dead ends: 6252 [2021-10-05 21:09:09,583 INFO L226 Difference]: Without dead ends: 5344 [2021-10-05 21:09:09,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 136.5ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:09:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2021-10-05 21:09:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4588. [2021-10-05 21:09:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 4587 states have (on average 3.306954436450839) internal successors, (15169), 4587 states have internal predecessors, (15169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 15169 transitions. [2021-10-05 21:09:09,854 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 15169 transitions. Word has length 38 [2021-10-05 21:09:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:09,854 INFO L470 AbstractCegarLoop]: Abstraction has 4588 states and 15169 transitions. [2021-10-05 21:09:09,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 15169 transitions. [2021-10-05 21:09:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:09,882 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:09,882 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:09,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 21:09:09,883 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1983960991, now seen corresponding path program 6 times [2021-10-05 21:09:09,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:09,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666288279] [2021-10-05 21:09:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:09,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:10,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:10,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666288279] [2021-10-05 21:09:10,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666288279] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:10,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:10,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:10,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970590675] [2021-10-05 21:09:10,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:10,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:10,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:10,046 INFO L87 Difference]: Start difference. First operand 4588 states and 15169 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:10,417 INFO L93 Difference]: Finished difference Result 4744 states and 15525 transitions. [2021-10-05 21:09:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:09:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:10,444 INFO L225 Difference]: With dead ends: 4744 [2021-10-05 21:09:10,444 INFO L226 Difference]: Without dead ends: 4676 [2021-10-05 21:09:10,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 154.7ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:09:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2021-10-05 21:09:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 4594. [2021-10-05 21:09:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4594 states, 4593 states have (on average 3.3052471151752667) internal successors, (15181), 4593 states have internal predecessors, (15181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4594 states to 4594 states and 15181 transitions. [2021-10-05 21:09:10,727 INFO L78 Accepts]: Start accepts. Automaton has 4594 states and 15181 transitions. Word has length 38 [2021-10-05 21:09:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:10,727 INFO L470 AbstractCegarLoop]: Abstraction has 4594 states and 15181 transitions. [2021-10-05 21:09:10,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4594 states and 15181 transitions. [2021-10-05 21:09:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:10,745 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:10,745 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:10,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 21:09:10,746 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash 201903121, now seen corresponding path program 7 times [2021-10-05 21:09:10,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:10,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949298582] [2021-10-05 21:09:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:10,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:10,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:10,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949298582] [2021-10-05 21:09:10,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949298582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:10,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:10,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:10,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470514307] [2021-10-05 21:09:10,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:10,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:10,951 INFO L87 Difference]: Start difference. First operand 4594 states and 15181 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:11,262 INFO L93 Difference]: Finished difference Result 4764 states and 15581 transitions. [2021-10-05 21:09:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:09:11,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:11,290 INFO L225 Difference]: With dead ends: 4764 [2021-10-05 21:09:11,291 INFO L226 Difference]: Without dead ends: 4646 [2021-10-05 21:09:11,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 113.4ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:09:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2021-10-05 21:09:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 4598. [2021-10-05 21:09:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4598 states, 4597 states have (on average 3.303241244289754) internal successors, (15185), 4597 states have internal predecessors, (15185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 15185 transitions. [2021-10-05 21:09:11,568 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 15185 transitions. Word has length 38 [2021-10-05 21:09:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:11,569 INFO L470 AbstractCegarLoop]: Abstraction has 4598 states and 15185 transitions. [2021-10-05 21:09:11,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 15185 transitions. [2021-10-05 21:09:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:11,586 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:11,587 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:11,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 21:09:11,588 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1664575563, now seen corresponding path program 8 times [2021-10-05 21:09:11,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:11,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404550065] [2021-10-05 21:09:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:11,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:11,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:11,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404550065] [2021-10-05 21:09:11,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404550065] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:11,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:11,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:11,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289363849] [2021-10-05 21:09:11,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:11,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:11,792 INFO L87 Difference]: Start difference. First operand 4598 states and 15185 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:12,101 INFO L93 Difference]: Finished difference Result 4792 states and 15639 transitions. [2021-10-05 21:09:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:09:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:12,128 INFO L225 Difference]: With dead ends: 4792 [2021-10-05 21:09:12,128 INFO L226 Difference]: Without dead ends: 4680 [2021-10-05 21:09:12,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 116.9ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:09:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2021-10-05 21:09:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4590. [2021-10-05 21:09:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4590 states, 4589 states have (on average 3.305295271300937) internal successors, (15168), 4589 states have internal predecessors, (15168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 15168 transitions. [2021-10-05 21:09:12,298 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 15168 transitions. Word has length 38 [2021-10-05 21:09:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:12,299 INFO L470 AbstractCegarLoop]: Abstraction has 4590 states and 15168 transitions. [2021-10-05 21:09:12,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 15168 transitions. [2021-10-05 21:09:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:12,317 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:12,317 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:12,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 21:09:12,317 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1667946649, now seen corresponding path program 9 times [2021-10-05 21:09:12,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:12,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790943933] [2021-10-05 21:09:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:12,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:12,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:12,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790943933] [2021-10-05 21:09:12,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790943933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:12,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:12,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:12,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837556845] [2021-10-05 21:09:12,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:12,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:12,465 INFO L87 Difference]: Start difference. First operand 4590 states and 15168 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:12,758 INFO L93 Difference]: Finished difference Result 4734 states and 15491 transitions. [2021-10-05 21:09:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:09:12,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:12,782 INFO L225 Difference]: With dead ends: 4734 [2021-10-05 21:09:12,782 INFO L226 Difference]: Without dead ends: 4666 [2021-10-05 21:09:12,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 122.5ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:09:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2021-10-05 21:09:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4596. [2021-10-05 21:09:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 4595 states have (on average 3.3029379760609356) internal successors, (15177), 4595 states have internal predecessors, (15177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 15177 transitions. [2021-10-05 21:09:13,002 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 15177 transitions. Word has length 38 [2021-10-05 21:09:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:13,002 INFO L470 AbstractCegarLoop]: Abstraction has 4596 states and 15177 transitions. [2021-10-05 21:09:13,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 15177 transitions. [2021-10-05 21:09:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:13,022 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:13,022 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:13,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 21:09:13,023 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -441156535, now seen corresponding path program 10 times [2021-10-05 21:09:13,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:13,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890971181] [2021-10-05 21:09:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:13,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:13,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:13,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890971181] [2021-10-05 21:09:13,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890971181] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:13,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:13,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:13,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458331281] [2021-10-05 21:09:13,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:13,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:13,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:13,158 INFO L87 Difference]: Start difference. First operand 4596 states and 15177 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:13,456 INFO L93 Difference]: Finished difference Result 4800 states and 15646 transitions. [2021-10-05 21:09:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:09:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:13,478 INFO L225 Difference]: With dead ends: 4800 [2021-10-05 21:09:13,478 INFO L226 Difference]: Without dead ends: 4664 [2021-10-05 21:09:13,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:09:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2021-10-05 21:09:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 4608. [2021-10-05 21:09:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4607 states have (on average 3.2969394399826353) internal successors, (15189), 4607 states have internal predecessors, (15189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 15189 transitions. [2021-10-05 21:09:13,774 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 15189 transitions. Word has length 38 [2021-10-05 21:09:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:13,774 INFO L470 AbstractCegarLoop]: Abstraction has 4608 states and 15189 transitions. [2021-10-05 21:09:13,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 15189 transitions. [2021-10-05 21:09:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:13,795 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:13,795 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:13,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 21:09:13,796 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1191537169, now seen corresponding path program 11 times [2021-10-05 21:09:13,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:13,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290519351] [2021-10-05 21:09:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:13,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:13,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:13,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290519351] [2021-10-05 21:09:13,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290519351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:13,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:13,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:13,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735880320] [2021-10-05 21:09:13,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:13,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:13,991 INFO L87 Difference]: Start difference. First operand 4608 states and 15189 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:14,297 INFO L93 Difference]: Finished difference Result 4818 states and 15675 transitions. [2021-10-05 21:09:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:09:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:14,318 INFO L225 Difference]: With dead ends: 4818 [2021-10-05 21:09:14,318 INFO L226 Difference]: Without dead ends: 4682 [2021-10-05 21:09:14,319 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 76.3ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:09:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2021-10-05 21:09:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4584. [2021-10-05 21:09:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 3.301112808204233) internal successors, (15129), 4583 states have internal predecessors, (15129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 15129 transitions. [2021-10-05 21:09:14,509 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 15129 transitions. Word has length 38 [2021-10-05 21:09:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:14,510 INFO L470 AbstractCegarLoop]: Abstraction has 4584 states and 15129 transitions. [2021-10-05 21:09:14,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 15129 transitions. [2021-10-05 21:09:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:14,527 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:14,527 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:14,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 21:09:14,528 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1194600461, now seen corresponding path program 12 times [2021-10-05 21:09:14,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:14,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129550864] [2021-10-05 21:09:14,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:14,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:14,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:14,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129550864] [2021-10-05 21:09:14,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129550864] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:14,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:14,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:14,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409721091] [2021-10-05 21:09:14,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:14,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:14,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:14,686 INFO L87 Difference]: Start difference. First operand 4584 states and 15129 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:15,264 INFO L93 Difference]: Finished difference Result 6372 states and 20060 transitions. [2021-10-05 21:09:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:09:15,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:15,292 INFO L225 Difference]: With dead ends: 6372 [2021-10-05 21:09:15,293 INFO L226 Difference]: Without dead ends: 6050 [2021-10-05 21:09:15,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 203.7ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:09:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2021-10-05 21:09:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 4716. [2021-10-05 21:09:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4716 states, 4715 states have (on average 3.274443266171792) internal successors, (15439), 4715 states have internal predecessors, (15439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 15439 transitions. [2021-10-05 21:09:15,528 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 15439 transitions. Word has length 38 [2021-10-05 21:09:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:15,528 INFO L470 AbstractCegarLoop]: Abstraction has 4716 states and 15439 transitions. [2021-10-05 21:09:15,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 15439 transitions. [2021-10-05 21:09:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:15,550 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:15,550 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:15,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 21:09:15,551 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash 991263651, now seen corresponding path program 13 times [2021-10-05 21:09:15,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:15,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063801205] [2021-10-05 21:09:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:15,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:15,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:15,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063801205] [2021-10-05 21:09:15,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063801205] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:15,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:15,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:09:15,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369613409] [2021-10-05 21:09:15,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:09:15,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:09:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:09:15,714 INFO L87 Difference]: Start difference. First operand 4716 states and 15439 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:16,159 INFO L93 Difference]: Finished difference Result 6538 states and 20777 transitions. [2021-10-05 21:09:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:09:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:16,178 INFO L225 Difference]: With dead ends: 6538 [2021-10-05 21:09:16,179 INFO L226 Difference]: Without dead ends: 6402 [2021-10-05 21:09:16,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 136.8ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:09:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6402 states. [2021-10-05 21:09:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6402 to 4692. [2021-10-05 21:09:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 4691 states have (on average 3.2775527606054147) internal successors, (15375), 4691 states have internal predecessors, (15375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 15375 transitions. [2021-10-05 21:09:16,471 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 15375 transitions. Word has length 38 [2021-10-05 21:09:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:16,471 INFO L470 AbstractCegarLoop]: Abstraction has 4692 states and 15375 transitions. [2021-10-05 21:09:16,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 15375 transitions. [2021-10-05 21:09:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:16,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:16,485 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:16,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 21:09:16,486 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash 454452083, now seen corresponding path program 14 times [2021-10-05 21:09:16,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:16,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259884324] [2021-10-05 21:09:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:16,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:16,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:16,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259884324] [2021-10-05 21:09:16,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259884324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:16,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:16,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:16,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971284268] [2021-10-05 21:09:16,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:16,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:16,632 INFO L87 Difference]: Start difference. First operand 4692 states and 15375 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:17,189 INFO L93 Difference]: Finished difference Result 5860 states and 19109 transitions. [2021-10-05 21:09:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:09:17,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:17,216 INFO L225 Difference]: With dead ends: 5860 [2021-10-05 21:09:17,216 INFO L226 Difference]: Without dead ends: 5792 [2021-10-05 21:09:17,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 201.9ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:09:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2021-10-05 21:09:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 4688. [2021-10-05 21:09:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4687 states have (on average 3.278429699167911) internal successors, (15366), 4687 states have internal predecessors, (15366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 15366 transitions. [2021-10-05 21:09:17,390 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 15366 transitions. Word has length 38 [2021-10-05 21:09:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:17,391 INFO L470 AbstractCegarLoop]: Abstraction has 4688 states and 15366 transitions. [2021-10-05 21:09:17,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 15366 transitions. [2021-10-05 21:09:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:17,404 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:17,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:17,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 21:09:17,405 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1654651101, now seen corresponding path program 15 times [2021-10-05 21:09:17,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:17,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547592830] [2021-10-05 21:09:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:17,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:17,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:17,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547592830] [2021-10-05 21:09:17,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547592830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:17,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:17,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:17,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483238583] [2021-10-05 21:09:17,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:17,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:17,579 INFO L87 Difference]: Start difference. First operand 4688 states and 15366 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:18,213 INFO L93 Difference]: Finished difference Result 6104 states and 19560 transitions. [2021-10-05 21:09:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 21:09:18,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:18,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:18,234 INFO L225 Difference]: With dead ends: 6104 [2021-10-05 21:09:18,235 INFO L226 Difference]: Without dead ends: 5908 [2021-10-05 21:09:18,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 244.8ms TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:09:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5908 states. [2021-10-05 21:09:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5908 to 4844. [2021-10-05 21:09:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4844 states, 4843 states have (on average 3.281437125748503) internal successors, (15892), 4843 states have internal predecessors, (15892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 15892 transitions. [2021-10-05 21:09:18,414 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 15892 transitions. Word has length 38 [2021-10-05 21:09:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:18,414 INFO L470 AbstractCegarLoop]: Abstraction has 4844 states and 15892 transitions. [2021-10-05 21:09:18,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 15892 transitions. [2021-10-05 21:09:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:18,433 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:18,433 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:18,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 21:09:18,434 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash -191978659, now seen corresponding path program 16 times [2021-10-05 21:09:18,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:18,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014168878] [2021-10-05 21:09:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:18,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:18,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:18,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014168878] [2021-10-05 21:09:18,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014168878] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:18,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:18,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:18,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819943453] [2021-10-05 21:09:18,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:18,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:18,578 INFO L87 Difference]: Start difference. First operand 4844 states and 15892 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:19,232 INFO L93 Difference]: Finished difference Result 6168 states and 19764 transitions. [2021-10-05 21:09:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 21:09:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:19,248 INFO L225 Difference]: With dead ends: 6168 [2021-10-05 21:09:19,249 INFO L226 Difference]: Without dead ends: 5974 [2021-10-05 21:09:19,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 228.5ms TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:09:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2021-10-05 21:09:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 5060. [2021-10-05 21:09:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 5059 states have (on average 3.2860249061079263) internal successors, (16624), 5059 states have internal predecessors, (16624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16624 transitions. [2021-10-05 21:09:19,465 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16624 transitions. Word has length 38 [2021-10-05 21:09:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:19,466 INFO L470 AbstractCegarLoop]: Abstraction has 5060 states and 16624 transitions. [2021-10-05 21:09:19,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16624 transitions. [2021-10-05 21:09:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:19,482 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:19,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 21:09:19,483 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1700623171, now seen corresponding path program 17 times [2021-10-05 21:09:19,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:19,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119554760] [2021-10-05 21:09:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:19,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:19,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:19,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119554760] [2021-10-05 21:09:19,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119554760] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:19,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:19,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:19,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149457939] [2021-10-05 21:09:19,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:19,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:19,650 INFO L87 Difference]: Start difference. First operand 5060 states and 16624 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:20,256 INFO L93 Difference]: Finished difference Result 6160 states and 19568 transitions. [2021-10-05 21:09:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:09:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:20,283 INFO L225 Difference]: With dead ends: 6160 [2021-10-05 21:09:20,284 INFO L226 Difference]: Without dead ends: 6076 [2021-10-05 21:09:20,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 194.0ms TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:09:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2021-10-05 21:09:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 4978. [2021-10-05 21:09:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4977 states have (on average 3.288527225236086) internal successors, (16367), 4977 states have internal predecessors, (16367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 16367 transitions. [2021-10-05 21:09:20,499 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 16367 transitions. Word has length 38 [2021-10-05 21:09:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:20,500 INFO L470 AbstractCegarLoop]: Abstraction has 4978 states and 16367 transitions. [2021-10-05 21:09:20,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 16367 transitions. [2021-10-05 21:09:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:20,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:20,515 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:20,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 21:09:20,516 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash 485240941, now seen corresponding path program 18 times [2021-10-05 21:09:20,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:20,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660377893] [2021-10-05 21:09:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:20,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:20,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:20,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660377893] [2021-10-05 21:09:20,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660377893] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:20,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:20,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:09:20,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050252495] [2021-10-05 21:09:20,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:09:20,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:20,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:09:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:09:20,617 INFO L87 Difference]: Start difference. First operand 4978 states and 16367 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:20,974 INFO L93 Difference]: Finished difference Result 6098 states and 19340 transitions. [2021-10-05 21:09:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:09:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:20,996 INFO L225 Difference]: With dead ends: 6098 [2021-10-05 21:09:20,997 INFO L226 Difference]: Without dead ends: 5962 [2021-10-05 21:09:20,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 84.3ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:09:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2021-10-05 21:09:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 4910. [2021-10-05 21:09:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 4909 states have (on average 3.2913016907720514) internal successors, (16157), 4909 states have internal predecessors, (16157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 16157 transitions. [2021-10-05 21:09:21,211 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 16157 transitions. Word has length 38 [2021-10-05 21:09:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:21,213 INFO L470 AbstractCegarLoop]: Abstraction has 4910 states and 16157 transitions. [2021-10-05 21:09:21,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 16157 transitions. [2021-10-05 21:09:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:21,232 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:21,233 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:21,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 21:09:21,233 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -188066323, now seen corresponding path program 19 times [2021-10-05 21:09:21,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:21,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773991142] [2021-10-05 21:09:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:21,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:21,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:21,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773991142] [2021-10-05 21:09:21,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773991142] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:21,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:21,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:09:21,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791868164] [2021-10-05 21:09:21,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:09:21,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:09:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:09:21,354 INFO L87 Difference]: Start difference. First operand 4910 states and 16157 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:21,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:21,618 INFO L93 Difference]: Finished difference Result 4536 states and 13579 transitions. [2021-10-05 21:09:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:09:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:21,634 INFO L225 Difference]: With dead ends: 4536 [2021-10-05 21:09:21,635 INFO L226 Difference]: Without dead ends: 4536 [2021-10-05 21:09:21,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 50.8ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2021-10-05 21:09:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3706. [2021-10-05 21:09:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3705 states have (on average 3.056140350877193) internal successors, (11323), 3705 states have internal predecessors, (11323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 11323 transitions. [2021-10-05 21:09:21,763 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 11323 transitions. Word has length 38 [2021-10-05 21:09:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:21,763 INFO L470 AbstractCegarLoop]: Abstraction has 3706 states and 11323 transitions. [2021-10-05 21:09:21,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 11323 transitions. [2021-10-05 21:09:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:21,774 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:21,774 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:21,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 21:09:21,775 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash -321727587, now seen corresponding path program 20 times [2021-10-05 21:09:21,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:21,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650665798] [2021-10-05 21:09:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:21,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:21,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:21,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650665798] [2021-10-05 21:09:21,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650665798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:21,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:21,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:21,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917668040] [2021-10-05 21:09:21,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:21,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:21,910 INFO L87 Difference]: Start difference. First operand 3706 states and 11323 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:22,710 INFO L93 Difference]: Finished difference Result 5154 states and 15119 transitions. [2021-10-05 21:09:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:09:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:22,724 INFO L225 Difference]: With dead ends: 5154 [2021-10-05 21:09:22,725 INFO L226 Difference]: Without dead ends: 5014 [2021-10-05 21:09:22,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 273.0ms TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2021-10-05 21:09:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5014 states. [2021-10-05 21:09:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5014 to 3836. [2021-10-05 21:09:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 3835 states have (on average 3.0404172099087354) internal successors, (11660), 3835 states have internal predecessors, (11660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 11660 transitions. [2021-10-05 21:09:22,837 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 11660 transitions. Word has length 38 [2021-10-05 21:09:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:22,838 INFO L470 AbstractCegarLoop]: Abstraction has 3836 states and 11660 transitions. [2021-10-05 21:09:22,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 11660 transitions. [2021-10-05 21:09:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:22,849 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:22,849 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:22,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 21:09:22,850 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:22,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1170595613, now seen corresponding path program 21 times [2021-10-05 21:09:22,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:22,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737971623] [2021-10-05 21:09:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:22,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:22,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:22,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737971623] [2021-10-05 21:09:22,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737971623] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:22,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:22,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:22,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811358186] [2021-10-05 21:09:22,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:22,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:22,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:22,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:22,990 INFO L87 Difference]: Start difference. First operand 3836 states and 11660 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:24,401 INFO L93 Difference]: Finished difference Result 6370 states and 18514 transitions. [2021-10-05 21:09:24,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-10-05 21:09:24,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:24,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:24,413 INFO L225 Difference]: With dead ends: 6370 [2021-10-05 21:09:24,414 INFO L226 Difference]: Without dead ends: 5994 [2021-10-05 21:09:24,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 572.6ms TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2021-10-05 21:09:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2021-10-05 21:09:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 4074. [2021-10-05 21:09:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 4073 states have (on average 3.025534004419347) internal successors, (12323), 4073 states have internal predecessors, (12323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 12323 transitions. [2021-10-05 21:09:24,554 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 12323 transitions. Word has length 38 [2021-10-05 21:09:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:24,554 INFO L470 AbstractCegarLoop]: Abstraction has 4074 states and 12323 transitions. [2021-10-05 21:09:24,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 12323 transitions. [2021-10-05 21:09:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:24,562 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:24,562 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:24,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 21:09:24,563 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1999490939, now seen corresponding path program 22 times [2021-10-05 21:09:24,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:24,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235416793] [2021-10-05 21:09:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:24,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:24,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:24,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235416793] [2021-10-05 21:09:24,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235416793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:24,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:24,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:24,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565191926] [2021-10-05 21:09:24,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:24,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:24,665 INFO L87 Difference]: Start difference. First operand 4074 states and 12323 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:25,292 INFO L93 Difference]: Finished difference Result 5010 states and 14652 transitions. [2021-10-05 21:09:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:09:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:25,309 INFO L225 Difference]: With dead ends: 5010 [2021-10-05 21:09:25,309 INFO L226 Difference]: Without dead ends: 4992 [2021-10-05 21:09:25,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 215.1ms TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:09:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2021-10-05 21:09:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4292. [2021-10-05 21:09:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4292 states, 4291 states have (on average 3.005593101841063) internal successors, (12897), 4291 states have internal predecessors, (12897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 12897 transitions. [2021-10-05 21:09:25,410 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 12897 transitions. Word has length 38 [2021-10-05 21:09:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:25,410 INFO L470 AbstractCegarLoop]: Abstraction has 4292 states and 12897 transitions. [2021-10-05 21:09:25,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 12897 transitions. [2021-10-05 21:09:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:25,420 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:25,420 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:25,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 21:09:25,421 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 117067827, now seen corresponding path program 23 times [2021-10-05 21:09:25,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:25,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424169329] [2021-10-05 21:09:25,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:25,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:25,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:25,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424169329] [2021-10-05 21:09:25,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424169329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:25,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:25,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:25,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353662480] [2021-10-05 21:09:25,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:25,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:25,512 INFO L87 Difference]: Start difference. First operand 4292 states and 12897 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:26,046 INFO L93 Difference]: Finished difference Result 5830 states and 16904 transitions. [2021-10-05 21:09:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:09:26,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:26,058 INFO L225 Difference]: With dead ends: 5830 [2021-10-05 21:09:26,059 INFO L226 Difference]: Without dead ends: 5822 [2021-10-05 21:09:26,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 177.6ms TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:09:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2021-10-05 21:09:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 4350. [2021-10-05 21:09:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 4349 states have (on average 3.0036790066681998) internal successors, (13063), 4349 states have internal predecessors, (13063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 13063 transitions. [2021-10-05 21:09:26,168 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 13063 transitions. Word has length 38 [2021-10-05 21:09:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:26,169 INFO L470 AbstractCegarLoop]: Abstraction has 4350 states and 13063 transitions. [2021-10-05 21:09:26,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 13063 transitions. [2021-10-05 21:09:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:26,178 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:26,178 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:26,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 21:09:26,179 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash 838238755, now seen corresponding path program 24 times [2021-10-05 21:09:26,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:26,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711811499] [2021-10-05 21:09:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:26,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:26,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:26,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711811499] [2021-10-05 21:09:26,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711811499] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:26,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:26,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:26,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689183246] [2021-10-05 21:09:26,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:26,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:26,281 INFO L87 Difference]: Start difference. First operand 4350 states and 13063 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:27,059 INFO L93 Difference]: Finished difference Result 5594 states and 16031 transitions. [2021-10-05 21:09:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 21:09:27,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:27,077 INFO L225 Difference]: With dead ends: 5594 [2021-10-05 21:09:27,077 INFO L226 Difference]: Without dead ends: 5562 [2021-10-05 21:09:27,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 269.8ms TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:09:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2021-10-05 21:09:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4310. [2021-10-05 21:09:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4309 states have (on average 3.0069621721977255) internal successors, (12957), 4309 states have internal predecessors, (12957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 12957 transitions. [2021-10-05 21:09:27,220 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 12957 transitions. Word has length 38 [2021-10-05 21:09:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:27,220 INFO L470 AbstractCegarLoop]: Abstraction has 4310 states and 12957 transitions. [2021-10-05 21:09:27,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 12957 transitions. [2021-10-05 21:09:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:27,232 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:27,232 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:27,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 21:09:27,232 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -428037203, now seen corresponding path program 25 times [2021-10-05 21:09:27,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:27,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342314721] [2021-10-05 21:09:27,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:27,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:27,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:27,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342314721] [2021-10-05 21:09:27,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342314721] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:27,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:27,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:27,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819902848] [2021-10-05 21:09:27,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:27,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:27,357 INFO L87 Difference]: Start difference. First operand 4310 states and 12957 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:27,942 INFO L93 Difference]: Finished difference Result 5708 states and 16342 transitions. [2021-10-05 21:09:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 21:09:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:27,960 INFO L225 Difference]: With dead ends: 5708 [2021-10-05 21:09:27,960 INFO L226 Difference]: Without dead ends: 5692 [2021-10-05 21:09:27,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 190.3ms TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:09:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5692 states. [2021-10-05 21:09:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5692 to 4314. [2021-10-05 21:09:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 4313 states have (on average 2.9979132854161836) internal successors, (12930), 4313 states have internal predecessors, (12930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 12930 transitions. [2021-10-05 21:09:28,061 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 12930 transitions. Word has length 38 [2021-10-05 21:09:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:28,061 INFO L470 AbstractCegarLoop]: Abstraction has 4314 states and 12930 transitions. [2021-10-05 21:09:28,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 12930 transitions. [2021-10-05 21:09:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:28,069 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:28,069 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:28,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 21:09:28,070 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 293133725, now seen corresponding path program 26 times [2021-10-05 21:09:28,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:28,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136863094] [2021-10-05 21:09:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:28,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:28,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:28,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136863094] [2021-10-05 21:09:28,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136863094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:28,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:28,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:28,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463511986] [2021-10-05 21:09:28,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:28,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:28,179 INFO L87 Difference]: Start difference. First operand 4314 states and 12930 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:28,947 INFO L93 Difference]: Finished difference Result 5710 states and 16309 transitions. [2021-10-05 21:09:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:09:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:28,962 INFO L225 Difference]: With dead ends: 5710 [2021-10-05 21:09:28,963 INFO L226 Difference]: Without dead ends: 5670 [2021-10-05 21:09:28,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 273.4ms TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:09:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5670 states. [2021-10-05 21:09:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5670 to 4270. [2021-10-05 21:09:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4270 states, 4269 states have (on average 2.9990630124150854) internal successors, (12803), 4269 states have internal predecessors, (12803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 12803 transitions. [2021-10-05 21:09:29,071 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 12803 transitions. Word has length 38 [2021-10-05 21:09:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:29,071 INFO L470 AbstractCegarLoop]: Abstraction has 4270 states and 12803 transitions. [2021-10-05 21:09:29,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 12803 transitions. [2021-10-05 21:09:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:29,083 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:29,083 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:29,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 21:09:29,084 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:29,085 INFO L82 PathProgramCache]: Analyzing trace with hash 930379165, now seen corresponding path program 27 times [2021-10-05 21:09:29,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:29,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972682442] [2021-10-05 21:09:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:29,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:29,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:29,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972682442] [2021-10-05 21:09:29,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972682442] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:29,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:29,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:29,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513713456] [2021-10-05 21:09:29,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:29,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:29,190 INFO L87 Difference]: Start difference. First operand 4270 states and 12803 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:29,778 INFO L93 Difference]: Finished difference Result 5976 states and 17159 transitions. [2021-10-05 21:09:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 21:09:29,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:29,792 INFO L225 Difference]: With dead ends: 5976 [2021-10-05 21:09:29,792 INFO L226 Difference]: Without dead ends: 5828 [2021-10-05 21:09:29,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 178.1ms TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:09:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2021-10-05 21:09:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 4286. [2021-10-05 21:09:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4285 states have (on average 2.9971995332555426) internal successors, (12843), 4285 states have internal predecessors, (12843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 12843 transitions. [2021-10-05 21:09:29,883 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 12843 transitions. Word has length 38 [2021-10-05 21:09:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:29,883 INFO L470 AbstractCegarLoop]: Abstraction has 4286 states and 12843 transitions. [2021-10-05 21:09:29,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 12843 transitions. [2021-10-05 21:09:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:29,891 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:29,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:29,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-05 21:09:29,892 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 47097069, now seen corresponding path program 28 times [2021-10-05 21:09:29,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:29,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837724817] [2021-10-05 21:09:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:29,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:30,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:30,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837724817] [2021-10-05 21:09:30,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837724817] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:30,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:30,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:30,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659874320] [2021-10-05 21:09:30,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:30,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:30,032 INFO L87 Difference]: Start difference. First operand 4286 states and 12843 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:31,053 INFO L93 Difference]: Finished difference Result 5698 states and 16136 transitions. [2021-10-05 21:09:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-05 21:09:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:31,065 INFO L225 Difference]: With dead ends: 5698 [2021-10-05 21:09:31,066 INFO L226 Difference]: Without dead ends: 5510 [2021-10-05 21:09:31,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 438.9ms TimeCoverageRelationStatistics Valid=420, Invalid=1650, Unknown=0, NotChecked=0, Total=2070 [2021-10-05 21:09:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2021-10-05 21:09:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 3880. [2021-10-05 21:09:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3879 states have (on average 2.9989688063934006) internal successors, (11633), 3879 states have internal predecessors, (11633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 11633 transitions. [2021-10-05 21:09:31,147 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 11633 transitions. Word has length 38 [2021-10-05 21:09:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:31,147 INFO L470 AbstractCegarLoop]: Abstraction has 3880 states and 11633 transitions. [2021-10-05 21:09:31,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 11633 transitions. [2021-10-05 21:09:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:31,156 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:31,156 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:31,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-05 21:09:31,157 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:31,157 INFO L82 PathProgramCache]: Analyzing trace with hash -708803817, now seen corresponding path program 29 times [2021-10-05 21:09:31,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:31,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735456168] [2021-10-05 21:09:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:31,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:31,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:31,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735456168] [2021-10-05 21:09:31,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735456168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:31,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:31,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:31,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561426148] [2021-10-05 21:09:31,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:31,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:31,277 INFO L87 Difference]: Start difference. First operand 3880 states and 11633 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:32,075 INFO L93 Difference]: Finished difference Result 4610 states and 13390 transitions. [2021-10-05 21:09:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:09:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:32,086 INFO L225 Difference]: With dead ends: 4610 [2021-10-05 21:09:32,086 INFO L226 Difference]: Without dead ends: 4586 [2021-10-05 21:09:32,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 329.1ms TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:09:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2021-10-05 21:09:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 3954. [2021-10-05 21:09:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3953 states have (on average 2.985074626865672) internal successors, (11800), 3953 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 11800 transitions. [2021-10-05 21:09:32,172 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 11800 transitions. Word has length 38 [2021-10-05 21:09:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:32,173 INFO L470 AbstractCegarLoop]: Abstraction has 3954 states and 11800 transitions. [2021-10-05 21:09:32,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 11800 transitions. [2021-10-05 21:09:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:32,211 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:32,212 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:32,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-05 21:09:32,212 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1405943655, now seen corresponding path program 30 times [2021-10-05 21:09:32,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:32,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577837928] [2021-10-05 21:09:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:32,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:32,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:32,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577837928] [2021-10-05 21:09:32,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577837928] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:32,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:32,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:32,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931883417] [2021-10-05 21:09:32,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:32,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:32,331 INFO L87 Difference]: Start difference. First operand 3954 states and 11800 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:33,083 INFO L93 Difference]: Finished difference Result 5524 states and 16046 transitions. [2021-10-05 21:09:33,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:09:33,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:33,094 INFO L225 Difference]: With dead ends: 5524 [2021-10-05 21:09:33,095 INFO L226 Difference]: Without dead ends: 5508 [2021-10-05 21:09:33,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 309.4ms TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:09:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2021-10-05 21:09:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 4022. [2021-10-05 21:09:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4021 states have (on average 2.990300920169112) internal successors, (12024), 4021 states have internal predecessors, (12024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 12024 transitions. [2021-10-05 21:09:33,206 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 12024 transitions. Word has length 38 [2021-10-05 21:09:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:33,206 INFO L470 AbstractCegarLoop]: Abstraction has 4022 states and 12024 transitions. [2021-10-05 21:09:33,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 12024 transitions. [2021-10-05 21:09:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:33,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:33,213 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:33,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-05 21:09:33,214 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:33,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1211511691, now seen corresponding path program 31 times [2021-10-05 21:09:33,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:33,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515622625] [2021-10-05 21:09:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:33,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:33,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:33,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515622625] [2021-10-05 21:09:33,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515622625] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:33,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:33,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:33,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073108700] [2021-10-05 21:09:33,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:33,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:33,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:33,340 INFO L87 Difference]: Start difference. First operand 4022 states and 12024 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:34,366 INFO L93 Difference]: Finished difference Result 5590 states and 16173 transitions. [2021-10-05 21:09:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 21:09:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:34,379 INFO L225 Difference]: With dead ends: 5590 [2021-10-05 21:09:34,379 INFO L226 Difference]: Without dead ends: 5548 [2021-10-05 21:09:34,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 437.7ms TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 21:09:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2021-10-05 21:09:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 4008. [2021-10-05 21:09:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4008 states, 4007 states have (on average 2.9920139755428) internal successors, (11989), 4007 states have internal predecessors, (11989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 11989 transitions. [2021-10-05 21:09:34,461 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 11989 transitions. Word has length 38 [2021-10-05 21:09:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:34,462 INFO L470 AbstractCegarLoop]: Abstraction has 4008 states and 11989 transitions. [2021-10-05 21:09:34,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 11989 transitions. [2021-10-05 21:09:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:34,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:34,469 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:34,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-05 21:09:34,470 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2048816405, now seen corresponding path program 32 times [2021-10-05 21:09:34,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:34,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133070575] [2021-10-05 21:09:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:34,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:34,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:34,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133070575] [2021-10-05 21:09:34,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133070575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:34,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:34,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:34,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379098273] [2021-10-05 21:09:34,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:34,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:34,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:34,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:34,581 INFO L87 Difference]: Start difference. First operand 4008 states and 11989 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:35,317 INFO L93 Difference]: Finished difference Result 5374 states and 15512 transitions. [2021-10-05 21:09:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-05 21:09:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:35,332 INFO L225 Difference]: With dead ends: 5374 [2021-10-05 21:09:35,332 INFO L226 Difference]: Without dead ends: 5362 [2021-10-05 21:09:35,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 292.6ms TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 21:09:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2021-10-05 21:09:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 3984. [2021-10-05 21:09:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3983 states have (on average 2.9859402460456943) internal successors, (11893), 3983 states have internal predecessors, (11893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 11893 transitions. [2021-10-05 21:09:35,414 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 11893 transitions. Word has length 38 [2021-10-05 21:09:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:35,415 INFO L470 AbstractCegarLoop]: Abstraction has 3984 states and 11893 transitions. [2021-10-05 21:09:35,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 11893 transitions. [2021-10-05 21:09:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:35,422 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:35,423 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:35,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-05 21:09:35,423 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1854384441, now seen corresponding path program 33 times [2021-10-05 21:09:35,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:35,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812944828] [2021-10-05 21:09:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:35,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:35,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:35,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812944828] [2021-10-05 21:09:35,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812944828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:35,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:35,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:35,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799692048] [2021-10-05 21:09:35,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:35,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:35,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:35,548 INFO L87 Difference]: Start difference. First operand 3984 states and 11893 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:36,411 INFO L93 Difference]: Finished difference Result 5362 states and 15448 transitions. [2021-10-05 21:09:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-10-05 21:09:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:36,422 INFO L225 Difference]: With dead ends: 5362 [2021-10-05 21:09:36,422 INFO L226 Difference]: Without dead ends: 5330 [2021-10-05 21:09:36,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 378.3ms TimeCoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2021-10-05 21:09:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2021-10-05 21:09:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 3924. [2021-10-05 21:09:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3923 states have (on average 2.985725210298241) internal successors, (11713), 3923 states have internal predecessors, (11713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 11713 transitions. [2021-10-05 21:09:36,541 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 11713 transitions. Word has length 38 [2021-10-05 21:09:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:36,541 INFO L470 AbstractCegarLoop]: Abstraction has 3924 states and 11713 transitions. [2021-10-05 21:09:36,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 11713 transitions. [2021-10-05 21:09:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:36,552 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:36,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:36,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-05 21:09:36,553 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:36,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 783442425, now seen corresponding path program 34 times [2021-10-05 21:09:36,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:36,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913439514] [2021-10-05 21:09:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:36,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:36,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:36,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913439514] [2021-10-05 21:09:36,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913439514] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:36,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:36,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:09:36,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198361404] [2021-10-05 21:09:36,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:09:36,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:09:36,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:09:36,651 INFO L87 Difference]: Start difference. First operand 3924 states and 11713 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:37,221 INFO L93 Difference]: Finished difference Result 5190 states and 15001 transitions. [2021-10-05 21:09:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 21:09:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:37,242 INFO L225 Difference]: With dead ends: 5190 [2021-10-05 21:09:37,242 INFO L226 Difference]: Without dead ends: 5072 [2021-10-05 21:09:37,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 183.7ms TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:09:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2021-10-05 21:09:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4038. [2021-10-05 21:09:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 4037 states have (on average 2.9769630914045084) internal successors, (12018), 4037 states have internal predecessors, (12018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 12018 transitions. [2021-10-05 21:09:37,361 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 12018 transitions. Word has length 38 [2021-10-05 21:09:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:37,362 INFO L470 AbstractCegarLoop]: Abstraction has 4038 states and 12018 transitions. [2021-10-05 21:09:37,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 12018 transitions. [2021-10-05 21:09:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:37,369 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:37,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-05 21:09:37,370 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:37,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1318167409, now seen corresponding path program 35 times [2021-10-05 21:09:37,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:37,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199143479] [2021-10-05 21:09:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:37,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:37,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:37,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199143479] [2021-10-05 21:09:37,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199143479] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:37,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:37,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:37,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554514378] [2021-10-05 21:09:37,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:37,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:37,481 INFO L87 Difference]: Start difference. First operand 4038 states and 12018 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:38,469 INFO L93 Difference]: Finished difference Result 5626 states and 16095 transitions. [2021-10-05 21:09:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-05 21:09:38,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:38,515 INFO L225 Difference]: With dead ends: 5626 [2021-10-05 21:09:38,516 INFO L226 Difference]: Without dead ends: 5472 [2021-10-05 21:09:38,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 403.3ms TimeCoverageRelationStatistics Valid=397, Invalid=1409, Unknown=0, NotChecked=0, Total=1806 [2021-10-05 21:09:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2021-10-05 21:09:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 4104. [2021-10-05 21:09:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4104 states, 4103 states have (on average 2.974165244942725) internal successors, (12203), 4103 states have internal predecessors, (12203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 12203 transitions. [2021-10-05 21:09:38,676 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 12203 transitions. Word has length 38 [2021-10-05 21:09:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:38,677 INFO L470 AbstractCegarLoop]: Abstraction has 4104 states and 12203 transitions. [2021-10-05 21:09:38,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 12203 transitions. [2021-10-05 21:09:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:38,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:38,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:38,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-05 21:09:38,687 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:38,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:38,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1580468935, now seen corresponding path program 36 times [2021-10-05 21:09:38,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:38,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490902797] [2021-10-05 21:09:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:38,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:38,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:38,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490902797] [2021-10-05 21:09:38,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490902797] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:38,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:38,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:38,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031442126] [2021-10-05 21:09:38,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:38,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:38,802 INFO L87 Difference]: Start difference. First operand 4104 states and 12203 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:39,660 INFO L93 Difference]: Finished difference Result 5420 states and 15464 transitions. [2021-10-05 21:09:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:09:39,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:39,678 INFO L225 Difference]: With dead ends: 5420 [2021-10-05 21:09:39,678 INFO L226 Difference]: Without dead ends: 5074 [2021-10-05 21:09:39,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 319.8ms TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:09:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2021-10-05 21:09:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 4264. [2021-10-05 21:09:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4264 states, 4263 states have (on average 2.9659863945578233) internal successors, (12644), 4263 states have internal predecessors, (12644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 12644 transitions. [2021-10-05 21:09:39,807 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 12644 transitions. Word has length 38 [2021-10-05 21:09:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:39,807 INFO L470 AbstractCegarLoop]: Abstraction has 4264 states and 12644 transitions. [2021-10-05 21:09:39,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 12644 transitions. [2021-10-05 21:09:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:39,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:39,817 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:39,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-05 21:09:39,818 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1021802961, now seen corresponding path program 37 times [2021-10-05 21:09:39,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:39,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080843879] [2021-10-05 21:09:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:39,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:39,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:39,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080843879] [2021-10-05 21:09:39,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080843879] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:39,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:39,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:39,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983008067] [2021-10-05 21:09:39,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:39,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:39,929 INFO L87 Difference]: Start difference. First operand 4264 states and 12644 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:40,982 INFO L93 Difference]: Finished difference Result 5652 states and 15864 transitions. [2021-10-05 21:09:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-05 21:09:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:41,006 INFO L225 Difference]: With dead ends: 5652 [2021-10-05 21:09:41,007 INFO L226 Difference]: Without dead ends: 5394 [2021-10-05 21:09:41,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 454.8ms TimeCoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2021-10-05 21:09:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-10-05 21:09:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 3936. [2021-10-05 21:09:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3935 states have (on average 2.9575603557814487) internal successors, (11638), 3935 states have internal predecessors, (11638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 11638 transitions. [2021-10-05 21:09:41,142 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 11638 transitions. Word has length 38 [2021-10-05 21:09:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:41,143 INFO L470 AbstractCegarLoop]: Abstraction has 3936 states and 11638 transitions. [2021-10-05 21:09:41,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 11638 transitions. [2021-10-05 21:09:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:41,153 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:41,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:41,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-05 21:09:41,154 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -54192441, now seen corresponding path program 38 times [2021-10-05 21:09:41,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:41,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558051903] [2021-10-05 21:09:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:41,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:41,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:41,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558051903] [2021-10-05 21:09:41,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558051903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:41,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:41,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:41,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251150419] [2021-10-05 21:09:41,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:41,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:41,337 INFO L87 Difference]: Start difference. First operand 3936 states and 11638 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:42,173 INFO L93 Difference]: Finished difference Result 4496 states and 13219 transitions. [2021-10-05 21:09:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 21:09:42,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:42,193 INFO L225 Difference]: With dead ends: 4496 [2021-10-05 21:09:42,193 INFO L226 Difference]: Without dead ends: 4474 [2021-10-05 21:09:42,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 392.3ms TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:09:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2021-10-05 21:09:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 3944. [2021-10-05 21:09:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3943 states have (on average 2.956632006086736) internal successors, (11658), 3943 states have internal predecessors, (11658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 11658 transitions. [2021-10-05 21:09:42,302 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 11658 transitions. Word has length 38 [2021-10-05 21:09:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:42,302 INFO L470 AbstractCegarLoop]: Abstraction has 3944 states and 11658 transitions. [2021-10-05 21:09:42,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 11658 transitions. [2021-10-05 21:09:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:42,312 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:42,312 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:42,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-05 21:09:42,312 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash -190968269, now seen corresponding path program 39 times [2021-10-05 21:09:42,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:42,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283963593] [2021-10-05 21:09:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:42,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:42,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:42,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283963593] [2021-10-05 21:09:42,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283963593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:42,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:42,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:42,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382726983] [2021-10-05 21:09:42,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:42,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:42,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:42,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:42,449 INFO L87 Difference]: Start difference. First operand 3944 states and 11658 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:43,692 INFO L93 Difference]: Finished difference Result 5344 states and 14999 transitions. [2021-10-05 21:09:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-10-05 21:09:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:43,710 INFO L225 Difference]: With dead ends: 5344 [2021-10-05 21:09:43,710 INFO L226 Difference]: Without dead ends: 4900 [2021-10-05 21:09:43,711 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 579.7ms TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2021-10-05 21:09:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2021-10-05 21:09:43,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 3814. [2021-10-05 21:09:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3813 states have (on average 2.932074482035143) internal successors, (11180), 3813 states have internal predecessors, (11180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 11180 transitions. [2021-10-05 21:09:43,828 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 11180 transitions. Word has length 38 [2021-10-05 21:09:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:43,828 INFO L470 AbstractCegarLoop]: Abstraction has 3814 states and 11180 transitions. [2021-10-05 21:09:43,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 11180 transitions. [2021-10-05 21:09:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:43,838 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:43,838 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:43,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-05 21:09:43,839 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -853483989, now seen corresponding path program 40 times [2021-10-05 21:09:43,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:43,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574061165] [2021-10-05 21:09:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:43,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:43,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:43,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574061165] [2021-10-05 21:09:43,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574061165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:43,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:43,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:43,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425929237] [2021-10-05 21:09:43,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:43,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:43,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:43,993 INFO L87 Difference]: Start difference. First operand 3814 states and 11180 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:45,058 INFO L93 Difference]: Finished difference Result 5006 states and 14163 transitions. [2021-10-05 21:09:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 21:09:45,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:45,074 INFO L225 Difference]: With dead ends: 5006 [2021-10-05 21:09:45,075 INFO L226 Difference]: Without dead ends: 4970 [2021-10-05 21:09:45,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 502.4ms TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2021-10-05 21:09:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4970 states. [2021-10-05 21:09:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4970 to 3826. [2021-10-05 21:09:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3826 states, 3825 states have (on average 2.9286274509803922) internal successors, (11202), 3825 states have internal predecessors, (11202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 11202 transitions. [2021-10-05 21:09:45,187 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 11202 transitions. Word has length 38 [2021-10-05 21:09:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:45,188 INFO L470 AbstractCegarLoop]: Abstraction has 3826 states and 11202 transitions. [2021-10-05 21:09:45,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 11202 transitions. [2021-10-05 21:09:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:45,198 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:45,198 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:45,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-05 21:09:45,198 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 911260395, now seen corresponding path program 41 times [2021-10-05 21:09:45,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:45,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326840059] [2021-10-05 21:09:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:45,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:45,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:45,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326840059] [2021-10-05 21:09:45,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326840059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:45,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:45,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:45,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356337170] [2021-10-05 21:09:45,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:45,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:45,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:45,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:45,356 INFO L87 Difference]: Start difference. First operand 3826 states and 11202 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:46,317 INFO L93 Difference]: Finished difference Result 5764 states and 16036 transitions. [2021-10-05 21:09:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:09:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:46,330 INFO L225 Difference]: With dead ends: 5764 [2021-10-05 21:09:46,330 INFO L226 Difference]: Without dead ends: 5662 [2021-10-05 21:09:46,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 426.5ms TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 21:09:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2021-10-05 21:09:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 3774. [2021-10-05 21:09:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3773 states have (on average 2.933739729658097) internal successors, (11069), 3773 states have internal predecessors, (11069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 11069 transitions. [2021-10-05 21:09:46,407 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 11069 transitions. Word has length 38 [2021-10-05 21:09:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:46,407 INFO L470 AbstractCegarLoop]: Abstraction has 3774 states and 11069 transitions. [2021-10-05 21:09:46,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 11069 transitions. [2021-10-05 21:09:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:46,414 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:46,414 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:46,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-05 21:09:46,414 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1110862167, now seen corresponding path program 42 times [2021-10-05 21:09:46,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:46,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353587073] [2021-10-05 21:09:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:46,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:46,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:46,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353587073] [2021-10-05 21:09:46,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353587073] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:46,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:46,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:46,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493301190] [2021-10-05 21:09:46,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:46,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:46,541 INFO L87 Difference]: Start difference. First operand 3774 states and 11069 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:47,086 INFO L93 Difference]: Finished difference Result 4326 states and 12611 transitions. [2021-10-05 21:09:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:09:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:47,101 INFO L225 Difference]: With dead ends: 4326 [2021-10-05 21:09:47,102 INFO L226 Difference]: Without dead ends: 4312 [2021-10-05 21:09:47,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 221.7ms TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:09:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2021-10-05 21:09:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 3776. [2021-10-05 21:09:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3775 states have (on average 2.9329801324503313) internal successors, (11072), 3775 states have internal predecessors, (11072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11072 transitions. [2021-10-05 21:09:47,192 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11072 transitions. Word has length 38 [2021-10-05 21:09:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:47,192 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11072 transitions. [2021-10-05 21:09:47,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11072 transitions. [2021-10-05 21:09:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:47,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:47,200 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:47,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-05 21:09:47,200 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1596839181, now seen corresponding path program 43 times [2021-10-05 21:09:47,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:47,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913438233] [2021-10-05 21:09:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:47,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:47,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:47,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913438233] [2021-10-05 21:09:47,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913438233] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:47,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:47,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:47,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144046377] [2021-10-05 21:09:47,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:47,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:47,331 INFO L87 Difference]: Start difference. First operand 3776 states and 11072 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:48,265 INFO L93 Difference]: Finished difference Result 4812 states and 13598 transitions. [2021-10-05 21:09:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:09:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:48,280 INFO L225 Difference]: With dead ends: 4812 [2021-10-05 21:09:48,280 INFO L226 Difference]: Without dead ends: 4784 [2021-10-05 21:09:48,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 452.9ms TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 21:09:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4784 states. [2021-10-05 21:09:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4784 to 3798. [2021-10-05 21:09:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 3797 states have (on average 2.9325783513299974) internal successors, (11135), 3797 states have internal predecessors, (11135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 11135 transitions. [2021-10-05 21:09:48,394 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 11135 transitions. Word has length 38 [2021-10-05 21:09:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:48,394 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 11135 transitions. [2021-10-05 21:09:48,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 11135 transitions. [2021-10-05 21:09:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:48,404 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:48,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:48,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-05 21:09:48,404 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash 815705003, now seen corresponding path program 44 times [2021-10-05 21:09:48,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:48,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708821130] [2021-10-05 21:09:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:48,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:48,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:48,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708821130] [2021-10-05 21:09:48,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708821130] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:48,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:48,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:48,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658397260] [2021-10-05 21:09:48,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:48,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:48,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:48,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:48,550 INFO L87 Difference]: Start difference. First operand 3798 states and 11135 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:49,510 INFO L93 Difference]: Finished difference Result 5588 states and 15636 transitions. [2021-10-05 21:09:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:09:49,511 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:49,527 INFO L225 Difference]: With dead ends: 5588 [2021-10-05 21:09:49,528 INFO L226 Difference]: Without dead ends: 5572 [2021-10-05 21:09:49,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 460.2ms TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 21:09:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2021-10-05 21:09:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 3798. [2021-10-05 21:09:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 3797 states have (on average 2.929417961548591) internal successors, (11123), 3797 states have internal predecessors, (11123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 11123 transitions. [2021-10-05 21:09:49,646 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 11123 transitions. Word has length 38 [2021-10-05 21:09:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:49,646 INFO L470 AbstractCegarLoop]: Abstraction has 3798 states and 11123 transitions. [2021-10-05 21:09:49,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 11123 transitions. [2021-10-05 21:09:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:49,656 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:49,657 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:49,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-05 21:09:49,657 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1536875931, now seen corresponding path program 45 times [2021-10-05 21:09:49,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:49,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755523131] [2021-10-05 21:09:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:49,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:49,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:49,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755523131] [2021-10-05 21:09:49,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755523131] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:49,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:49,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:49,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095063082] [2021-10-05 21:09:49,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:49,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:49,800 INFO L87 Difference]: Start difference. First operand 3798 states and 11123 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:50,893 INFO L93 Difference]: Finished difference Result 4916 states and 13926 transitions. [2021-10-05 21:09:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 21:09:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:50,906 INFO L225 Difference]: With dead ends: 4916 [2021-10-05 21:09:50,906 INFO L226 Difference]: Without dead ends: 4900 [2021-10-05 21:09:50,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 543.6ms TimeCoverageRelationStatistics Valid=346, Invalid=1136, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 21:09:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2021-10-05 21:09:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 3796. [2021-10-05 21:09:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3795 states have (on average 2.927536231884058) internal successors, (11110), 3795 states have internal predecessors, (11110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 11110 transitions. [2021-10-05 21:09:51,032 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 11110 transitions. Word has length 38 [2021-10-05 21:09:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:51,032 INFO L470 AbstractCegarLoop]: Abstraction has 3796 states and 11110 transitions. [2021-10-05 21:09:51,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 11110 transitions. [2021-10-05 21:09:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:51,040 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:51,040 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:51,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-05 21:09:51,040 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1591792559, now seen corresponding path program 46 times [2021-10-05 21:09:51,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:51,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140278958] [2021-10-05 21:09:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:51,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:51,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:51,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140278958] [2021-10-05 21:09:51,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140278958] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:51,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:51,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:51,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37604642] [2021-10-05 21:09:51,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:51,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:51,165 INFO L87 Difference]: Start difference. First operand 3796 states and 11110 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:52,034 INFO L93 Difference]: Finished difference Result 5162 states and 14490 transitions. [2021-10-05 21:09:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:09:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:52,045 INFO L225 Difference]: With dead ends: 5162 [2021-10-05 21:09:52,045 INFO L226 Difference]: Without dead ends: 5148 [2021-10-05 21:09:52,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 403.8ms TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 21:09:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2021-10-05 21:09:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 3788. [2021-10-05 21:09:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3787 states have (on average 2.928967520464748) internal successors, (11092), 3787 states have internal predecessors, (11092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 11092 transitions. [2021-10-05 21:09:52,117 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 11092 transitions. Word has length 38 [2021-10-05 21:09:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:52,117 INFO L470 AbstractCegarLoop]: Abstraction has 3788 states and 11092 transitions. [2021-10-05 21:09:52,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 11092 transitions. [2021-10-05 21:09:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:52,125 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:52,125 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:52,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-05 21:09:52,126 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash 289232823, now seen corresponding path program 47 times [2021-10-05 21:09:52,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:52,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241847036] [2021-10-05 21:09:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:52,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:52,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:52,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241847036] [2021-10-05 21:09:52,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241847036] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:52,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:52,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:52,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41370769] [2021-10-05 21:09:52,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:52,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:52,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:52,263 INFO L87 Difference]: Start difference. First operand 3788 states and 11092 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:53,078 INFO L93 Difference]: Finished difference Result 4462 states and 12684 transitions. [2021-10-05 21:09:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:09:53,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:53,086 INFO L225 Difference]: With dead ends: 4462 [2021-10-05 21:09:53,086 INFO L226 Difference]: Without dead ends: 4430 [2021-10-05 21:09:53,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 358.2ms TimeCoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:09:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2021-10-05 21:09:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3776. [2021-10-05 21:09:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3775 states have (on average 2.9290066225165563) internal successors, (11057), 3775 states have internal predecessors, (11057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11057 transitions. [2021-10-05 21:09:53,150 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11057 transitions. Word has length 38 [2021-10-05 21:09:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:53,150 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11057 transitions. [2021-10-05 21:09:53,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11057 transitions. [2021-10-05 21:09:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:53,156 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:53,156 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:53,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-05 21:09:53,156 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1807470791, now seen corresponding path program 48 times [2021-10-05 21:09:53,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:53,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632571445] [2021-10-05 21:09:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:53,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:53,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:53,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632571445] [2021-10-05 21:09:53,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632571445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:53,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:53,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:53,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751970023] [2021-10-05 21:09:53,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:53,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:53,268 INFO L87 Difference]: Start difference. First operand 3776 states and 11057 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:54,035 INFO L93 Difference]: Finished difference Result 5170 states and 14569 transitions. [2021-10-05 21:09:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:09:54,036 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:54,046 INFO L225 Difference]: With dead ends: 5170 [2021-10-05 21:09:54,046 INFO L226 Difference]: Without dead ends: 5162 [2021-10-05 21:09:54,047 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 348.1ms TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 21:09:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2021-10-05 21:09:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 3794. [2021-10-05 21:09:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3793 states have (on average 2.9248615871341945) internal successors, (11094), 3793 states have internal predecessors, (11094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 11094 transitions. [2021-10-05 21:09:54,122 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 11094 transitions. Word has length 38 [2021-10-05 21:09:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:54,123 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 11094 transitions. [2021-10-05 21:09:54,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 11094 transitions. [2021-10-05 21:09:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:54,130 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:54,131 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:54,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-05 21:09:54,131 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1766325577, now seen corresponding path program 49 times [2021-10-05 21:09:54,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:54,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768382996] [2021-10-05 21:09:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:54,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:54,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:54,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768382996] [2021-10-05 21:09:54,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768382996] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:54,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:54,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:54,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374055652] [2021-10-05 21:09:54,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:54,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:54,271 INFO L87 Difference]: Start difference. First operand 3794 states and 11094 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:55,261 INFO L93 Difference]: Finished difference Result 5216 states and 14673 transitions. [2021-10-05 21:09:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-05 21:09:55,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:55,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:55,271 INFO L225 Difference]: With dead ends: 5216 [2021-10-05 21:09:55,272 INFO L226 Difference]: Without dead ends: 5208 [2021-10-05 21:09:55,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 497.3ms TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 21:09:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2021-10-05 21:09:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 3792. [2021-10-05 21:09:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 2.925085729359008) internal successors, (11089), 3791 states have internal predecessors, (11089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11089 transitions. [2021-10-05 21:09:55,346 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11089 transitions. Word has length 38 [2021-10-05 21:09:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:55,346 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11089 transitions. [2021-10-05 21:09:55,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11089 transitions. [2021-10-05 21:09:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:55,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:55,352 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:55,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-05 21:09:55,353 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash 679971847, now seen corresponding path program 50 times [2021-10-05 21:09:55,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:55,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155378894] [2021-10-05 21:09:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:55,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:55,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:55,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155378894] [2021-10-05 21:09:55,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155378894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:55,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:55,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:55,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313746322] [2021-10-05 21:09:55,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:55,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:55,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:55,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:55,464 INFO L87 Difference]: Start difference. First operand 3792 states and 11089 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:56,184 INFO L93 Difference]: Finished difference Result 5234 states and 14670 transitions. [2021-10-05 21:09:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:09:56,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:56,196 INFO L225 Difference]: With dead ends: 5234 [2021-10-05 21:09:56,196 INFO L226 Difference]: Without dead ends: 5226 [2021-10-05 21:09:56,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 312.2ms TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:09:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2021-10-05 21:09:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 3792. [2021-10-05 21:09:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 2.925085729359008) internal successors, (11089), 3791 states have internal predecessors, (11089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11089 transitions. [2021-10-05 21:09:56,275 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11089 transitions. Word has length 38 [2021-10-05 21:09:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:56,276 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11089 transitions. [2021-10-05 21:09:56,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11089 transitions. [2021-10-05 21:09:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:56,283 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:56,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:56,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-05 21:09:56,283 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1129080137, now seen corresponding path program 51 times [2021-10-05 21:09:56,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:56,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496952752] [2021-10-05 21:09:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:56,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:56,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:56,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496952752] [2021-10-05 21:09:56,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496952752] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:56,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:56,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:56,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146985836] [2021-10-05 21:09:56,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:56,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:56,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:56,407 INFO L87 Difference]: Start difference. First operand 3792 states and 11089 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:57,213 INFO L93 Difference]: Finished difference Result 5240 states and 14683 transitions. [2021-10-05 21:09:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:09:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:57,225 INFO L225 Difference]: With dead ends: 5240 [2021-10-05 21:09:57,225 INFO L226 Difference]: Without dead ends: 5212 [2021-10-05 21:09:57,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 334.8ms TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:09:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2021-10-05 21:09:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 3792. [2021-10-05 21:09:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 2.9240305987866) internal successors, (11085), 3791 states have internal predecessors, (11085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11085 transitions. [2021-10-05 21:09:57,311 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11085 transitions. Word has length 38 [2021-10-05 21:09:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:57,312 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11085 transitions. [2021-10-05 21:09:57,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11085 transitions. [2021-10-05 21:09:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:57,318 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:57,319 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:57,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-05 21:09:57,319 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2012362233, now seen corresponding path program 52 times [2021-10-05 21:09:57,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:57,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454655591] [2021-10-05 21:09:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:57,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:57,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:57,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454655591] [2021-10-05 21:09:57,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454655591] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:57,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:57,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:09:57,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354846948] [2021-10-05 21:09:57,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:09:57,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:09:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:09:57,447 INFO L87 Difference]: Start difference. First operand 3792 states and 11085 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:58,550 INFO L93 Difference]: Finished difference Result 5222 states and 14681 transitions. [2021-10-05 21:09:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-05 21:09:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:58,565 INFO L225 Difference]: With dead ends: 5222 [2021-10-05 21:09:58,565 INFO L226 Difference]: Without dead ends: 5172 [2021-10-05 21:09:58,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 514.4ms TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 21:09:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2021-10-05 21:09:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 3772. [2021-10-05 21:09:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3772 states, 3771 states have (on average 2.9291964996022277) internal successors, (11046), 3771 states have internal predecessors, (11046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3772 states to 3772 states and 11046 transitions. [2021-10-05 21:09:58,640 INFO L78 Accepts]: Start accepts. Automaton has 3772 states and 11046 transitions. Word has length 38 [2021-10-05 21:09:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:58,641 INFO L470 AbstractCegarLoop]: Abstraction has 3772 states and 11046 transitions. [2021-10-05 21:09:58,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3772 states and 11046 transitions. [2021-10-05 21:09:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:58,646 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:58,647 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:58,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-05 21:09:58,647 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1737242703, now seen corresponding path program 53 times [2021-10-05 21:09:58,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:58,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602677650] [2021-10-05 21:09:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:58,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:58,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:58,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602677650] [2021-10-05 21:09:58,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602677650] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:58,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:58,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:09:58,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504793646] [2021-10-05 21:09:58,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:09:58,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:09:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:09:58,761 INFO L87 Difference]: Start difference. First operand 3772 states and 11046 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:09:59,374 INFO L93 Difference]: Finished difference Result 4292 states and 12504 transitions. [2021-10-05 21:09:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:09:59,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:09:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:09:59,384 INFO L225 Difference]: With dead ends: 4292 [2021-10-05 21:09:59,385 INFO L226 Difference]: Without dead ends: 4278 [2021-10-05 21:09:59,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 229.4ms TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:09:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2021-10-05 21:09:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 3776. [2021-10-05 21:09:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3775 states have (on average 2.928741721854305) internal successors, (11056), 3775 states have internal predecessors, (11056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11056 transitions. [2021-10-05 21:09:59,457 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11056 transitions. Word has length 38 [2021-10-05 21:09:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:09:59,458 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11056 transitions. [2021-10-05 21:09:59,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:09:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11056 transitions. [2021-10-05 21:09:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:09:59,464 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:09:59,464 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:09:59,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-05 21:09:59,465 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:09:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:09:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2071747579, now seen corresponding path program 54 times [2021-10-05 21:09:59,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:09:59,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341057167] [2021-10-05 21:09:59,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:09:59,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:09:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:09:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:09:59,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:09:59,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341057167] [2021-10-05 21:09:59,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341057167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:09:59,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:09:59,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:09:59,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293173728] [2021-10-05 21:09:59,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:09:59,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:09:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:09:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:09:59,598 INFO L87 Difference]: Start difference. First operand 3776 states and 11056 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:00,629 INFO L93 Difference]: Finished difference Result 4742 states and 13422 transitions. [2021-10-05 21:10:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:10:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:00,638 INFO L225 Difference]: With dead ends: 4742 [2021-10-05 21:10:00,639 INFO L226 Difference]: Without dead ends: 4730 [2021-10-05 21:10:00,639 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 482.9ms TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 21:10:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2021-10-05 21:10:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 3790. [2021-10-05 21:10:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3789 states have (on average 2.927157561361837) internal successors, (11091), 3789 states have internal predecessors, (11091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 11091 transitions. [2021-10-05 21:10:00,701 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 11091 transitions. Word has length 38 [2021-10-05 21:10:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:00,702 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 11091 transitions. [2021-10-05 21:10:00,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 11091 transitions. [2021-10-05 21:10:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:00,707 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:00,708 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:00,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-05 21:10:00,708 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash -108472245, now seen corresponding path program 55 times [2021-10-05 21:10:00,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:00,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73282823] [2021-10-05 21:10:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:00,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:00,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:00,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73282823] [2021-10-05 21:10:00,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73282823] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:00,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:00,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:00,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704039599] [2021-10-05 21:10:00,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:00,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:00,828 INFO L87 Difference]: Start difference. First operand 3790 states and 11091 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:01,802 INFO L93 Difference]: Finished difference Result 5444 states and 15221 transitions. [2021-10-05 21:10:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:10:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:01,814 INFO L225 Difference]: With dead ends: 5444 [2021-10-05 21:10:01,814 INFO L226 Difference]: Without dead ends: 5436 [2021-10-05 21:10:01,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 425.5ms TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 21:10:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2021-10-05 21:10:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 3792. [2021-10-05 21:10:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 2.9264046425745187) internal successors, (11094), 3791 states have internal predecessors, (11094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11094 transitions. [2021-10-05 21:10:01,895 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11094 transitions. Word has length 38 [2021-10-05 21:10:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:01,895 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11094 transitions. [2021-10-05 21:10:01,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11094 transitions. [2021-10-05 21:10:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:01,902 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:01,902 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:01,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-05 21:10:01,902 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash -302904209, now seen corresponding path program 56 times [2021-10-05 21:10:01,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:01,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953337631] [2021-10-05 21:10:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:01,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:02,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:02,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953337631] [2021-10-05 21:10:02,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953337631] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:02,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:02,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:02,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101614175] [2021-10-05 21:10:02,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:02,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:02,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:02,031 INFO L87 Difference]: Start difference. First operand 3792 states and 11094 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:03,110 INFO L93 Difference]: Finished difference Result 4844 states and 13734 transitions. [2021-10-05 21:10:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:10:03,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:03,126 INFO L225 Difference]: With dead ends: 4844 [2021-10-05 21:10:03,126 INFO L226 Difference]: Without dead ends: 4828 [2021-10-05 21:10:03,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 514.3ms TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 21:10:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2021-10-05 21:10:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 3782. [2021-10-05 21:10:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 2.927532398836287) internal successors, (11069), 3781 states have internal predecessors, (11069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 11069 transitions. [2021-10-05 21:10:03,241 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 11069 transitions. Word has length 38 [2021-10-05 21:10:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:03,241 INFO L470 AbstractCegarLoop]: Abstraction has 3782 states and 11069 transitions. [2021-10-05 21:10:03,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 11069 transitions. [2021-10-05 21:10:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:03,251 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:03,251 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:03,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-05 21:10:03,252 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash 262072719, now seen corresponding path program 57 times [2021-10-05 21:10:03,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:03,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454456080] [2021-10-05 21:10:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:03,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:03,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:03,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454456080] [2021-10-05 21:10:03,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454456080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:03,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:03,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:03,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187581783] [2021-10-05 21:10:03,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:03,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:03,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:03,401 INFO L87 Difference]: Start difference. First operand 3782 states and 11069 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:04,210 INFO L93 Difference]: Finished difference Result 4282 states and 12473 transitions. [2021-10-05 21:10:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 21:10:04,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:04,219 INFO L225 Difference]: With dead ends: 4282 [2021-10-05 21:10:04,219 INFO L226 Difference]: Without dead ends: 4260 [2021-10-05 21:10:04,219 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 379.6ms TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:10:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2021-10-05 21:10:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3784. [2021-10-05 21:10:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 3783 states have (on average 2.9267776896642874) internal successors, (11072), 3783 states have internal predecessors, (11072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 11072 transitions. [2021-10-05 21:10:04,295 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 11072 transitions. Word has length 38 [2021-10-05 21:10:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:04,298 INFO L470 AbstractCegarLoop]: Abstraction has 3784 states and 11072 transitions. [2021-10-05 21:10:04,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 11072 transitions. [2021-10-05 21:10:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:04,305 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:04,305 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:04,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-05 21:10:04,306 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1334248131, now seen corresponding path program 58 times [2021-10-05 21:10:04,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:04,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961334109] [2021-10-05 21:10:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:04,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:04,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:04,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961334109] [2021-10-05 21:10:04,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961334109] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:04,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:04,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:04,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764927795] [2021-10-05 21:10:04,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:04,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:04,447 INFO L87 Difference]: Start difference. First operand 3784 states and 11072 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:05,614 INFO L93 Difference]: Finished difference Result 4838 states and 13604 transitions. [2021-10-05 21:10:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 21:10:05,614 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:05,624 INFO L225 Difference]: With dead ends: 4838 [2021-10-05 21:10:05,624 INFO L226 Difference]: Without dead ends: 4782 [2021-10-05 21:10:05,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 559.2ms TimeCoverageRelationStatistics Valid=381, Invalid=1259, Unknown=0, NotChecked=0, Total=1640 [2021-10-05 21:10:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2021-10-05 21:10:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 3810. [2021-10-05 21:10:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3810 states, 3809 states have (on average 2.9191388815962194) internal successors, (11119), 3809 states have internal predecessors, (11119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 11119 transitions. [2021-10-05 21:10:05,696 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 11119 transitions. Word has length 38 [2021-10-05 21:10:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:05,696 INFO L470 AbstractCegarLoop]: Abstraction has 3810 states and 11119 transitions. [2021-10-05 21:10:05,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 11119 transitions. [2021-10-05 21:10:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:05,704 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:05,704 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:05,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-05 21:10:05,704 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1121604557, now seen corresponding path program 59 times [2021-10-05 21:10:05,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:05,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268038533] [2021-10-05 21:10:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:05,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:05,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:05,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268038533] [2021-10-05 21:10:05,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268038533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:05,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:05,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:05,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997660921] [2021-10-05 21:10:05,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:05,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:05,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:05,845 INFO L87 Difference]: Start difference. First operand 3810 states and 11119 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:06,958 INFO L93 Difference]: Finished difference Result 4892 states and 13792 transitions. [2021-10-05 21:10:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-05 21:10:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:06,968 INFO L225 Difference]: With dead ends: 4892 [2021-10-05 21:10:06,968 INFO L226 Difference]: Without dead ends: 4860 [2021-10-05 21:10:06,969 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 550.4ms TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2021-10-05 21:10:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2021-10-05 21:10:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 3818. [2021-10-05 21:10:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3817 states have (on average 2.9166884988210637) internal successors, (11133), 3817 states have internal predecessors, (11133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 11133 transitions. [2021-10-05 21:10:07,038 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 11133 transitions. Word has length 38 [2021-10-05 21:10:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:07,038 INFO L470 AbstractCegarLoop]: Abstraction has 3818 states and 11133 transitions. [2021-10-05 21:10:07,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 11133 transitions. [2021-10-05 21:10:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:07,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:07,044 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:07,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-05 21:10:07,045 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:07,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1490790803, now seen corresponding path program 60 times [2021-10-05 21:10:07,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:07,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537758245] [2021-10-05 21:10:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:07,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:07,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:07,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537758245] [2021-10-05 21:10:07,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537758245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:07,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:07,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:07,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345874024] [2021-10-05 21:10:07,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:07,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:07,178 INFO L87 Difference]: Start difference. First operand 3818 states and 11133 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:08,127 INFO L93 Difference]: Finished difference Result 5528 states and 15358 transitions. [2021-10-05 21:10:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:10:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:08,138 INFO L225 Difference]: With dead ends: 5528 [2021-10-05 21:10:08,138 INFO L226 Difference]: Without dead ends: 5458 [2021-10-05 21:10:08,139 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 457.1ms TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 21:10:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2021-10-05 21:10:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 3784. [2021-10-05 21:10:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3784 states, 3783 states have (on average 2.9214908802537667) internal successors, (11052), 3783 states have internal predecessors, (11052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 11052 transitions. [2021-10-05 21:10:08,216 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 11052 transitions. Word has length 38 [2021-10-05 21:10:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:08,216 INFO L470 AbstractCegarLoop]: Abstraction has 3784 states and 11052 transitions. [2021-10-05 21:10:08,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 11052 transitions. [2021-10-05 21:10:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:08,222 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:08,222 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:08,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-05 21:10:08,223 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1708441429, now seen corresponding path program 61 times [2021-10-05 21:10:08,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:08,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738036083] [2021-10-05 21:10:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:08,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:08,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:08,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738036083] [2021-10-05 21:10:08,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738036083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:08,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:08,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:08,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204881643] [2021-10-05 21:10:08,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:08,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:08,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:08,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:08,331 INFO L87 Difference]: Start difference. First operand 3784 states and 11052 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:09,223 INFO L93 Difference]: Finished difference Result 5000 states and 14114 transitions. [2021-10-05 21:10:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:10:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:09,239 INFO L225 Difference]: With dead ends: 5000 [2021-10-05 21:10:09,239 INFO L226 Difference]: Without dead ends: 4992 [2021-10-05 21:10:09,240 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 383.6ms TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2021-10-05 21:10:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2021-10-05 21:10:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3794. [2021-10-05 21:10:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3793 states have (on average 2.918797785394147) internal successors, (11071), 3793 states have internal predecessors, (11071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 11071 transitions. [2021-10-05 21:10:09,338 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 11071 transitions. Word has length 38 [2021-10-05 21:10:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:09,338 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 11071 transitions. [2021-10-05 21:10:09,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 11071 transitions. [2021-10-05 21:10:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:09,345 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:09,345 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:09,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-05 21:10:09,346 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1514009465, now seen corresponding path program 62 times [2021-10-05 21:10:09,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:09,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654024537] [2021-10-05 21:10:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:09,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:09,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:09,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654024537] [2021-10-05 21:10:09,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654024537] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:09,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:09,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:09,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903344952] [2021-10-05 21:10:09,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:09,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:09,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:09,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:09,484 INFO L87 Difference]: Start difference. First operand 3794 states and 11071 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:10,478 INFO L93 Difference]: Finished difference Result 5036 states and 14194 transitions. [2021-10-05 21:10:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-05 21:10:10,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:10,488 INFO L225 Difference]: With dead ends: 5036 [2021-10-05 21:10:10,488 INFO L226 Difference]: Without dead ends: 5028 [2021-10-05 21:10:10,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 451.5ms TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 21:10:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2021-10-05 21:10:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 3792. [2021-10-05 21:10:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 2.9190187285676603) internal successors, (11066), 3791 states have internal predecessors, (11066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11066 transitions. [2021-10-05 21:10:10,559 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11066 transitions. Word has length 38 [2021-10-05 21:10:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:10,559 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11066 transitions. [2021-10-05 21:10:10,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11066 transitions. [2021-10-05 21:10:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:10,565 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:10,565 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:10,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-05 21:10:10,566 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 268313167, now seen corresponding path program 63 times [2021-10-05 21:10:10,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:10,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233064663] [2021-10-05 21:10:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:10,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:10,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:10,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233064663] [2021-10-05 21:10:10,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233064663] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:10,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:10,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:10,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304389401] [2021-10-05 21:10:10,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:10,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:10,676 INFO L87 Difference]: Start difference. First operand 3792 states and 11066 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:11,404 INFO L93 Difference]: Finished difference Result 5114 states and 14358 transitions. [2021-10-05 21:10:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:10:11,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:11,415 INFO L225 Difference]: With dead ends: 5114 [2021-10-05 21:10:11,415 INFO L226 Difference]: Without dead ends: 5106 [2021-10-05 21:10:11,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 319.1ms TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:10:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2021-10-05 21:10:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 3794. [2021-10-05 21:10:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3793 states have (on average 2.918270498286317) internal successors, (11069), 3793 states have internal predecessors, (11069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 11069 transitions. [2021-10-05 21:10:11,495 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 11069 transitions. Word has length 38 [2021-10-05 21:10:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:11,495 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 11069 transitions. [2021-10-05 21:10:11,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 11069 transitions. [2021-10-05 21:10:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:11,502 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:11,502 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:11,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-05 21:10:11,502 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:11,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 443067449, now seen corresponding path program 64 times [2021-10-05 21:10:11,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:11,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231944687] [2021-10-05 21:10:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:11,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:11,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:11,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231944687] [2021-10-05 21:10:11,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231944687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:11,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:11,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:11,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268918826] [2021-10-05 21:10:11,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:11,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:11,622 INFO L87 Difference]: Start difference. First operand 3794 states and 11069 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:12,395 INFO L93 Difference]: Finished difference Result 5136 states and 14401 transitions. [2021-10-05 21:10:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:10:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:12,406 INFO L225 Difference]: With dead ends: 5136 [2021-10-05 21:10:12,406 INFO L226 Difference]: Without dead ends: 5116 [2021-10-05 21:10:12,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 312.7ms TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:10:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5116 states. [2021-10-05 21:10:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5116 to 3792. [2021-10-05 21:10:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 3791 states have (on average 2.9184911632814563) internal successors, (11064), 3791 states have internal predecessors, (11064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 11064 transitions. [2021-10-05 21:10:12,483 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 11064 transitions. Word has length 38 [2021-10-05 21:10:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:12,483 INFO L470 AbstractCegarLoop]: Abstraction has 3792 states and 11064 transitions. [2021-10-05 21:10:12,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 11064 transitions. [2021-10-05 21:10:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:12,490 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:12,490 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:12,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-05 21:10:12,490 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1658542385, now seen corresponding path program 65 times [2021-10-05 21:10:12,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:12,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808994846] [2021-10-05 21:10:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:12,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:12,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:12,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808994846] [2021-10-05 21:10:12,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808994846] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:12,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:12,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:12,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511317921] [2021-10-05 21:10:12,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:12,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:12,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:12,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:12,626 INFO L87 Difference]: Start difference. First operand 3792 states and 11064 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:13,703 INFO L93 Difference]: Finished difference Result 5070 states and 14261 transitions. [2021-10-05 21:10:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-05 21:10:13,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:13,714 INFO L225 Difference]: With dead ends: 5070 [2021-10-05 21:10:13,714 INFO L226 Difference]: Without dead ends: 5032 [2021-10-05 21:10:13,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 508.8ms TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2021-10-05 21:10:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2021-10-05 21:10:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 3776. [2021-10-05 21:10:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3775 states have (on average 2.9234437086092715) internal successors, (11036), 3775 states have internal predecessors, (11036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 11036 transitions. [2021-10-05 21:10:13,787 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 11036 transitions. Word has length 38 [2021-10-05 21:10:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:13,787 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 11036 transitions. [2021-10-05 21:10:13,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 11036 transitions. [2021-10-05 21:10:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:13,793 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:13,793 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:13,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-05 21:10:13,794 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1915311487, now seen corresponding path program 66 times [2021-10-05 21:10:13,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:13,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388569877] [2021-10-05 21:10:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:13,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:13,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:13,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388569877] [2021-10-05 21:10:13,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388569877] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:13,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:13,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:13,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084366973] [2021-10-05 21:10:13,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:13,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:13,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:13,928 INFO L87 Difference]: Start difference. First operand 3776 states and 11036 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:14,775 INFO L93 Difference]: Finished difference Result 4598 states and 12959 transitions. [2021-10-05 21:10:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:10:14,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:14,784 INFO L225 Difference]: With dead ends: 4598 [2021-10-05 21:10:14,784 INFO L226 Difference]: Without dead ends: 4414 [2021-10-05 21:10:14,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 327.5ms TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2021-10-05 21:10:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2021-10-05 21:10:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 3964. [2021-10-05 21:10:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3964 states, 3963 states have (on average 2.8925056775170326) internal successors, (11463), 3963 states have internal predecessors, (11463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3964 states to 3964 states and 11463 transitions. [2021-10-05 21:10:14,852 INFO L78 Accepts]: Start accepts. Automaton has 3964 states and 11463 transitions. Word has length 38 [2021-10-05 21:10:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:14,852 INFO L470 AbstractCegarLoop]: Abstraction has 3964 states and 11463 transitions. [2021-10-05 21:10:14,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3964 states and 11463 transitions. [2021-10-05 21:10:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:14,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:14,859 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:14,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-05 21:10:14,859 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1061450289, now seen corresponding path program 67 times [2021-10-05 21:10:14,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:14,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713647404] [2021-10-05 21:10:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:14,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:15,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:15,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713647404] [2021-10-05 21:10:15,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713647404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:15,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:15,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:15,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446574522] [2021-10-05 21:10:15,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:15,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:15,030 INFO L87 Difference]: Start difference. First operand 3964 states and 11463 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:16,190 INFO L93 Difference]: Finished difference Result 4878 states and 13669 transitions. [2021-10-05 21:10:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-10-05 21:10:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:16,200 INFO L225 Difference]: With dead ends: 4878 [2021-10-05 21:10:16,200 INFO L226 Difference]: Without dead ends: 4676 [2021-10-05 21:10:16,200 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 455.0ms TimeCoverageRelationStatistics Valid=316, Invalid=1166, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 21:10:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4676 states. [2021-10-05 21:10:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4676 to 3928. [2021-10-05 21:10:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3927 states have (on average 2.893048128342246) internal successors, (11361), 3927 states have internal predecessors, (11361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 11361 transitions. [2021-10-05 21:10:16,271 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 11361 transitions. Word has length 38 [2021-10-05 21:10:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:16,271 INFO L470 AbstractCegarLoop]: Abstraction has 3928 states and 11361 transitions. [2021-10-05 21:10:16,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 11361 transitions. [2021-10-05 21:10:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:16,279 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:16,279 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:16,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-10-05 21:10:16,280 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1888338645, now seen corresponding path program 68 times [2021-10-05 21:10:16,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:16,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087666722] [2021-10-05 21:10:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:16,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:16,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:16,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087666722] [2021-10-05 21:10:16,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087666722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:16,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:16,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:16,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990333117] [2021-10-05 21:10:16,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:16,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:16,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:16,419 INFO L87 Difference]: Start difference. First operand 3928 states and 11361 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:17,362 INFO L93 Difference]: Finished difference Result 4734 states and 13210 transitions. [2021-10-05 21:10:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:10:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:17,372 INFO L225 Difference]: With dead ends: 4734 [2021-10-05 21:10:17,372 INFO L226 Difference]: Without dead ends: 4648 [2021-10-05 21:10:17,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 343.5ms TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:10:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2021-10-05 21:10:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3928. [2021-10-05 21:10:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3927 states have (on average 2.8854087089381206) internal successors, (11331), 3927 states have internal predecessors, (11331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 11331 transitions. [2021-10-05 21:10:17,441 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 11331 transitions. Word has length 38 [2021-10-05 21:10:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:17,442 INFO L470 AbstractCegarLoop]: Abstraction has 3928 states and 11331 transitions. [2021-10-05 21:10:17,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 11331 transitions. [2021-10-05 21:10:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:17,448 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:17,448 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:17,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-10-05 21:10:17,448 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1744112931, now seen corresponding path program 69 times [2021-10-05 21:10:17,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:17,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130745158] [2021-10-05 21:10:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:17,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:17,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:17,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130745158] [2021-10-05 21:10:17,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130745158] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:17,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:17,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:17,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618962432] [2021-10-05 21:10:17,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:17,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:17,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:17,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:17,583 INFO L87 Difference]: Start difference. First operand 3928 states and 11331 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:18,603 INFO L93 Difference]: Finished difference Result 4878 states and 13605 transitions. [2021-10-05 21:10:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-05 21:10:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:18,612 INFO L225 Difference]: With dead ends: 4878 [2021-10-05 21:10:18,613 INFO L226 Difference]: Without dead ends: 4822 [2021-10-05 21:10:18,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 390.6ms TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2021-10-05 21:10:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4822 states. [2021-10-05 21:10:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4822 to 3948. [2021-10-05 21:10:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3947 states have (on average 2.8801621484671904) internal successors, (11368), 3947 states have internal predecessors, (11368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11368 transitions. [2021-10-05 21:10:18,683 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11368 transitions. Word has length 38 [2021-10-05 21:10:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:18,683 INFO L470 AbstractCegarLoop]: Abstraction has 3948 states and 11368 transitions. [2021-10-05 21:10:18,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11368 transitions. [2021-10-05 21:10:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:18,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:18,690 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:18,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-10-05 21:10:18,690 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash -786109981, now seen corresponding path program 70 times [2021-10-05 21:10:18,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:18,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258079301] [2021-10-05 21:10:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:18,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:18,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:18,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258079301] [2021-10-05 21:10:18,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258079301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:18,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:18,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:18,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320373466] [2021-10-05 21:10:18,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:18,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:18,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:18,816 INFO L87 Difference]: Start difference. First operand 3948 states and 11368 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:19,720 INFO L93 Difference]: Finished difference Result 5320 states and 14725 transitions. [2021-10-05 21:10:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:10:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:19,731 INFO L225 Difference]: With dead ends: 5320 [2021-10-05 21:10:19,731 INFO L226 Difference]: Without dead ends: 5152 [2021-10-05 21:10:19,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 315.6ms TimeCoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:10:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5152 states. [2021-10-05 21:10:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5152 to 3856. [2021-10-05 21:10:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3856 states, 3855 states have (on average 2.8843060959792477) internal successors, (11119), 3855 states have internal predecessors, (11119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 11119 transitions. [2021-10-05 21:10:19,804 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 11119 transitions. Word has length 38 [2021-10-05 21:10:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:19,804 INFO L470 AbstractCegarLoop]: Abstraction has 3856 states and 11119 transitions. [2021-10-05 21:10:19,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 11119 transitions. [2021-10-05 21:10:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:19,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:19,810 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:19,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-10-05 21:10:19,811 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:19,811 INFO L82 PathProgramCache]: Analyzing trace with hash -776678947, now seen corresponding path program 71 times [2021-10-05 21:10:19,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:19,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779748731] [2021-10-05 21:10:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:19,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:19,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:19,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779748731] [2021-10-05 21:10:19,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779748731] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:19,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:19,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:19,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866521728] [2021-10-05 21:10:19,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:19,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:19,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:19,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:19,936 INFO L87 Difference]: Start difference. First operand 3856 states and 11119 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:20,603 INFO L93 Difference]: Finished difference Result 4172 states and 11800 transitions. [2021-10-05 21:10:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-05 21:10:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:20,612 INFO L225 Difference]: With dead ends: 4172 [2021-10-05 21:10:20,612 INFO L226 Difference]: Without dead ends: 4098 [2021-10-05 21:10:20,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 242.3ms TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:10:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-10-05 21:10:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3916. [2021-10-05 21:10:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 2.874329501915709) internal successors, (11253), 3915 states have internal predecessors, (11253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 11253 transitions. [2021-10-05 21:10:20,678 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 11253 transitions. Word has length 38 [2021-10-05 21:10:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:20,678 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 11253 transitions. [2021-10-05 21:10:20,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 11253 transitions. [2021-10-05 21:10:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:20,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:20,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:20,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-10-05 21:10:20,685 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:20,685 INFO L82 PathProgramCache]: Analyzing trace with hash 429124977, now seen corresponding path program 72 times [2021-10-05 21:10:20,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:20,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415557957] [2021-10-05 21:10:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:20,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:20,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:20,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415557957] [2021-10-05 21:10:20,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415557957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:20,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:20,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:20,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611719358] [2021-10-05 21:10:20,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:20,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:20,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:20,815 INFO L87 Difference]: Start difference. First operand 3916 states and 11253 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:21,571 INFO L93 Difference]: Finished difference Result 4322 states and 12224 transitions. [2021-10-05 21:10:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:21,581 INFO L225 Difference]: With dead ends: 4322 [2021-10-05 21:10:21,581 INFO L226 Difference]: Without dead ends: 4234 [2021-10-05 21:10:21,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 318.2ms TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:10:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2021-10-05 21:10:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3904. [2021-10-05 21:10:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3903 states have (on average 2.8698437099666925) internal successors, (11201), 3903 states have internal predecessors, (11201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 11201 transitions. [2021-10-05 21:10:21,656 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 11201 transitions. Word has length 38 [2021-10-05 21:10:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:21,657 INFO L470 AbstractCegarLoop]: Abstraction has 3904 states and 11201 transitions. [2021-10-05 21:10:21,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 11201 transitions. [2021-10-05 21:10:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:21,663 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:21,664 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:21,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-10-05 21:10:21,664 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash -56852037, now seen corresponding path program 73 times [2021-10-05 21:10:21,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:21,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280457077] [2021-10-05 21:10:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:21,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:21,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:21,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280457077] [2021-10-05 21:10:21,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280457077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:21,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:21,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:21,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551879456] [2021-10-05 21:10:21,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:21,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:21,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:21,792 INFO L87 Difference]: Start difference. First operand 3904 states and 11201 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:22,519 INFO L93 Difference]: Finished difference Result 4500 states and 12633 transitions. [2021-10-05 21:10:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-05 21:10:22,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:22,527 INFO L225 Difference]: With dead ends: 4500 [2021-10-05 21:10:22,527 INFO L226 Difference]: Without dead ends: 4480 [2021-10-05 21:10:22,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 246.2ms TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2021-10-05 21:10:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2021-10-05 21:10:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3904. [2021-10-05 21:10:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3903 states have (on average 2.8672815782731234) internal successors, (11191), 3903 states have internal predecessors, (11191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 11191 transitions. [2021-10-05 21:10:22,594 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 11191 transitions. Word has length 38 [2021-10-05 21:10:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:22,595 INFO L470 AbstractCegarLoop]: Abstraction has 3904 states and 11191 transitions. [2021-10-05 21:10:22,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 11191 transitions. [2021-10-05 21:10:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:22,601 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:22,601 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:22,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-10-05 21:10:22,601 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1939275149, now seen corresponding path program 74 times [2021-10-05 21:10:22,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:22,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602354123] [2021-10-05 21:10:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:22,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:22,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:22,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602354123] [2021-10-05 21:10:22,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602354123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:22,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:22,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:22,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436207089] [2021-10-05 21:10:22,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:22,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:22,713 INFO L87 Difference]: Start difference. First operand 3904 states and 11191 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:23,450 INFO L93 Difference]: Finished difference Result 5132 states and 14261 transitions. [2021-10-05 21:10:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 21:10:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:23,463 INFO L225 Difference]: With dead ends: 5132 [2021-10-05 21:10:23,463 INFO L226 Difference]: Without dead ends: 5124 [2021-10-05 21:10:23,464 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 257.6ms TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2021-10-05 21:10:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2021-10-05 21:10:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 3906. [2021-10-05 21:10:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 3905 states have (on average 2.865556978233035) internal successors, (11190), 3905 states have internal predecessors, (11190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 11190 transitions. [2021-10-05 21:10:23,549 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 11190 transitions. Word has length 38 [2021-10-05 21:10:23,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:23,549 INFO L470 AbstractCegarLoop]: Abstraction has 3906 states and 11190 transitions. [2021-10-05 21:10:23,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 11190 transitions. [2021-10-05 21:10:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:23,556 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:23,556 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:23,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-10-05 21:10:23,556 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1218104221, now seen corresponding path program 75 times [2021-10-05 21:10:23,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:23,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587747671] [2021-10-05 21:10:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:23,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:23,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:23,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587747671] [2021-10-05 21:10:23,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587747671] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:23,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:23,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:23,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218046769] [2021-10-05 21:10:23,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:23,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:23,680 INFO L87 Difference]: Start difference. First operand 3906 states and 11190 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:24,559 INFO L93 Difference]: Finished difference Result 4644 states and 13024 transitions. [2021-10-05 21:10:24,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-05 21:10:24,559 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:24,567 INFO L225 Difference]: With dead ends: 4644 [2021-10-05 21:10:24,568 INFO L226 Difference]: Without dead ends: 4602 [2021-10-05 21:10:24,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 305.8ms TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:10:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2021-10-05 21:10:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3874. [2021-10-05 21:10:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3874 states, 3873 states have (on average 2.8696101213529563) internal successors, (11114), 3873 states have internal predecessors, (11114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 11114 transitions. [2021-10-05 21:10:24,631 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 11114 transitions. Word has length 38 [2021-10-05 21:10:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:24,632 INFO L470 AbstractCegarLoop]: Abstraction has 3874 states and 11114 transitions. [2021-10-05 21:10:24,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 11114 transitions. [2021-10-05 21:10:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:24,640 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:24,640 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:24,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-10-05 21:10:24,641 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -270768385, now seen corresponding path program 76 times [2021-10-05 21:10:24,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:24,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618714544] [2021-10-05 21:10:24,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:24,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:24,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:24,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618714544] [2021-10-05 21:10:24,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618714544] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:24,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:24,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:24,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832139500] [2021-10-05 21:10:24,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:24,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:24,765 INFO L87 Difference]: Start difference. First operand 3874 states and 11114 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:25,635 INFO L93 Difference]: Finished difference Result 4380 states and 12433 transitions. [2021-10-05 21:10:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:10:25,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:25,644 INFO L225 Difference]: With dead ends: 4380 [2021-10-05 21:10:25,645 INFO L226 Difference]: Without dead ends: 4312 [2021-10-05 21:10:25,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 400.2ms TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 21:10:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2021-10-05 21:10:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 3838. [2021-10-05 21:10:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3837 states have (on average 2.871514203805056) internal successors, (11018), 3837 states have internal predecessors, (11018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 11018 transitions. [2021-10-05 21:10:25,715 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 11018 transitions. Word has length 38 [2021-10-05 21:10:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:25,715 INFO L470 AbstractCegarLoop]: Abstraction has 3838 states and 11018 transitions. [2021-10-05 21:10:25,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 11018 transitions. [2021-10-05 21:10:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:25,722 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:25,722 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:25,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-10-05 21:10:25,722 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash 660473423, now seen corresponding path program 77 times [2021-10-05 21:10:25,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:25,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377100096] [2021-10-05 21:10:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:25,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:25,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:25,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377100096] [2021-10-05 21:10:25,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377100096] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:25,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:25,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:25,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727127798] [2021-10-05 21:10:25,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:25,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:25,851 INFO L87 Difference]: Start difference. First operand 3838 states and 11018 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:26,847 INFO L93 Difference]: Finished difference Result 4644 states and 13106 transitions. [2021-10-05 21:10:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:10:26,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:26,856 INFO L225 Difference]: With dead ends: 4644 [2021-10-05 21:10:26,857 INFO L226 Difference]: Without dead ends: 4560 [2021-10-05 21:10:26,857 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 406.2ms TimeCoverageRelationStatistics Valid=255, Invalid=935, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 21:10:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4560 states. [2021-10-05 21:10:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4560 to 3742. [2021-10-05 21:10:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 2.879443998930767) internal successors, (10772), 3741 states have internal predecessors, (10772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 10772 transitions. [2021-10-05 21:10:26,921 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 10772 transitions. Word has length 38 [2021-10-05 21:10:26,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:26,921 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 10772 transitions. [2021-10-05 21:10:26,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 10772 transitions. [2021-10-05 21:10:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:26,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:26,927 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:26,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-10-05 21:10:26,927 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:26,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:26,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1343504207, now seen corresponding path program 78 times [2021-10-05 21:10:26,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:26,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274220217] [2021-10-05 21:10:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:26,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:27,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:27,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274220217] [2021-10-05 21:10:27,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274220217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:27,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:27,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:27,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726611293] [2021-10-05 21:10:27,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:27,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:27,033 INFO L87 Difference]: Start difference. First operand 3742 states and 10772 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:27,642 INFO L93 Difference]: Finished difference Result 4500 states and 12692 transitions. [2021-10-05 21:10:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 21:10:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:27,652 INFO L225 Difference]: With dead ends: 4500 [2021-10-05 21:10:27,652 INFO L226 Difference]: Without dead ends: 4492 [2021-10-05 21:10:27,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 217.3ms TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:10:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2021-10-05 21:10:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 3742. [2021-10-05 21:10:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 2.878909382518043) internal successors, (10770), 3741 states have internal predecessors, (10770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 10770 transitions. [2021-10-05 21:10:27,767 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 10770 transitions. Word has length 38 [2021-10-05 21:10:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:27,767 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 10770 transitions. [2021-10-05 21:10:27,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 10770 transitions. [2021-10-05 21:10:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:27,775 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:27,775 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:27,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-10-05 21:10:27,776 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2064675135, now seen corresponding path program 79 times [2021-10-05 21:10:27,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:27,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70084600] [2021-10-05 21:10:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:27,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:27,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-10-05 21:10:27,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:27,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70084600] [2021-10-05 21:10:27,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70084600] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:27,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:27,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:27,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280831017] [2021-10-05 21:10:27,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:27,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:27,910 INFO L87 Difference]: Start difference. First operand 3742 states and 10770 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:28,631 INFO L93 Difference]: Finished difference Result 4536 states and 12777 transitions. [2021-10-05 21:10:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:28,642 INFO L225 Difference]: With dead ends: 4536 [2021-10-05 21:10:28,642 INFO L226 Difference]: Without dead ends: 4528 [2021-10-05 21:10:28,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 288.4ms TimeCoverageRelationStatistics Valid=236, Invalid=756, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:10:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4528 states. [2021-10-05 21:10:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4528 to 3740. [2021-10-05 21:10:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3739 states have (on average 2.879112062048676) internal successors, (10765), 3739 states have internal predecessors, (10765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 10765 transitions. [2021-10-05 21:10:28,722 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 10765 transitions. Word has length 38 [2021-10-05 21:10:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:28,722 INFO L470 AbstractCegarLoop]: Abstraction has 3740 states and 10765 transitions. [2021-10-05 21:10:28,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 10765 transitions. [2021-10-05 21:10:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:28,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:28,729 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:28,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-10-05 21:10:28,729 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash 216005263, now seen corresponding path program 80 times [2021-10-05 21:10:28,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:28,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760791382] [2021-10-05 21:10:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:28,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:28,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:28,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760791382] [2021-10-05 21:10:28,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760791382] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:28,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:28,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:28,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267093356] [2021-10-05 21:10:28,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:28,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:28,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:28,833 INFO L87 Difference]: Start difference. First operand 3740 states and 10765 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:29,448 INFO L93 Difference]: Finished difference Result 4558 states and 12780 transitions. [2021-10-05 21:10:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-05 21:10:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:29,456 INFO L225 Difference]: With dead ends: 4558 [2021-10-05 21:10:29,456 INFO L226 Difference]: Without dead ends: 4550 [2021-10-05 21:10:29,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 210.1ms TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:10:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2021-10-05 21:10:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 3736. [2021-10-05 21:10:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3735 states have (on average 2.879785809906292) internal successors, (10756), 3735 states have internal predecessors, (10756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 10756 transitions. [2021-10-05 21:10:29,533 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 10756 transitions. Word has length 38 [2021-10-05 21:10:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:29,534 INFO L470 AbstractCegarLoop]: Abstraction has 3736 states and 10756 transitions. [2021-10-05 21:10:29,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 10756 transitions. [2021-10-05 21:10:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:29,540 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:29,540 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:29,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-10-05 21:10:29,541 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:29,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1593046721, now seen corresponding path program 81 times [2021-10-05 21:10:29,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:29,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78958759] [2021-10-05 21:10:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:29,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:29,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:29,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78958759] [2021-10-05 21:10:29,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78958759] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:29,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:29,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:29,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206410943] [2021-10-05 21:10:29,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:29,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:29,658 INFO L87 Difference]: Start difference. First operand 3736 states and 10756 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:30,350 INFO L93 Difference]: Finished difference Result 4592 states and 12861 transitions. [2021-10-05 21:10:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-05 21:10:30,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:30,359 INFO L225 Difference]: With dead ends: 4592 [2021-10-05 21:10:30,360 INFO L226 Difference]: Without dead ends: 4564 [2021-10-05 21:10:30,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 235.9ms TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2021-10-05 21:10:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2021-10-05 21:10:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 3736. [2021-10-05 21:10:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3735 states have (on average 2.878714859437751) internal successors, (10752), 3735 states have internal predecessors, (10752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 10752 transitions. [2021-10-05 21:10:30,427 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 10752 transitions. Word has length 38 [2021-10-05 21:10:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:30,427 INFO L470 AbstractCegarLoop]: Abstraction has 3736 states and 10752 transitions. [2021-10-05 21:10:30,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 10752 transitions. [2021-10-05 21:10:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:30,434 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:30,434 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:30,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-10-05 21:10:30,435 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1818638479, now seen corresponding path program 82 times [2021-10-05 21:10:30,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:30,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710555835] [2021-10-05 21:10:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:30,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:30,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:30,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710555835] [2021-10-05 21:10:30,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710555835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:30,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:30,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:30,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445028563] [2021-10-05 21:10:30,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:30,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:30,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:30,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:30,561 INFO L87 Difference]: Start difference. First operand 3736 states and 10752 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:31,307 INFO L93 Difference]: Finished difference Result 4562 states and 12836 transitions. [2021-10-05 21:10:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:10:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:31,316 INFO L225 Difference]: With dead ends: 4562 [2021-10-05 21:10:31,316 INFO L226 Difference]: Without dead ends: 4488 [2021-10-05 21:10:31,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 314.1ms TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 21:10:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4488 states. [2021-10-05 21:10:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4488 to 3686. [2021-10-05 21:10:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3685 states have (on average 2.8849389416553595) internal successors, (10631), 3685 states have internal predecessors, (10631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 10631 transitions. [2021-10-05 21:10:31,378 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 10631 transitions. Word has length 38 [2021-10-05 21:10:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:31,378 INFO L470 AbstractCegarLoop]: Abstraction has 3686 states and 10631 transitions. [2021-10-05 21:10:31,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 10631 transitions. [2021-10-05 21:10:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:31,384 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:31,384 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:31,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-10-05 21:10:31,384 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1288228103, now seen corresponding path program 83 times [2021-10-05 21:10:31,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:31,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572947789] [2021-10-05 21:10:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:31,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:31,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:31,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572947789] [2021-10-05 21:10:31,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572947789] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:31,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:31,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:31,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104779670] [2021-10-05 21:10:31,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:31,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:31,483 INFO L87 Difference]: Start difference. First operand 3686 states and 10631 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:32,049 INFO L93 Difference]: Finished difference Result 3858 states and 10993 transitions. [2021-10-05 21:10:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:10:32,049 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:32,056 INFO L225 Difference]: With dead ends: 3858 [2021-10-05 21:10:32,057 INFO L226 Difference]: Without dead ends: 3806 [2021-10-05 21:10:32,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 195.1ms TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:10:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2021-10-05 21:10:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3686. [2021-10-05 21:10:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3685 states have (on average 2.8789687924016283) internal successors, (10609), 3685 states have internal predecessors, (10609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 10609 transitions. [2021-10-05 21:10:32,115 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 10609 transitions. Word has length 38 [2021-10-05 21:10:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:32,116 INFO L470 AbstractCegarLoop]: Abstraction has 3686 states and 10609 transitions. [2021-10-05 21:10:32,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 10609 transitions. [2021-10-05 21:10:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:32,122 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:32,122 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:32,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-10-05 21:10:32,122 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -82424179, now seen corresponding path program 84 times [2021-10-05 21:10:32,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:32,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504269783] [2021-10-05 21:10:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:32,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:32,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:32,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504269783] [2021-10-05 21:10:32,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504269783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:32,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:32,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:32,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079658942] [2021-10-05 21:10:32,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:32,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:32,228 INFO L87 Difference]: Start difference. First operand 3686 states and 10609 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:32,980 INFO L93 Difference]: Finished difference Result 4424 states and 12371 transitions. [2021-10-05 21:10:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-05 21:10:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:32,988 INFO L225 Difference]: With dead ends: 4424 [2021-10-05 21:10:32,988 INFO L226 Difference]: Without dead ends: 4354 [2021-10-05 21:10:32,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 258.1ms TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2021-10-05 21:10:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2021-10-05 21:10:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 3668. [2021-10-05 21:10:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3667 states have (on average 2.873193346059449) internal successors, (10536), 3667 states have internal predecessors, (10536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 10536 transitions. [2021-10-05 21:10:33,051 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 10536 transitions. Word has length 38 [2021-10-05 21:10:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:33,051 INFO L470 AbstractCegarLoop]: Abstraction has 3668 states and 10536 transitions. [2021-10-05 21:10:33,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 10536 transitions. [2021-10-05 21:10:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:33,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:33,057 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:33,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-10-05 21:10:33,058 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:33,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1546346279, now seen corresponding path program 85 times [2021-10-05 21:10:33,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:33,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338137590] [2021-10-05 21:10:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:33,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:33,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:33,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338137590] [2021-10-05 21:10:33,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338137590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:33,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:33,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:33,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909534323] [2021-10-05 21:10:33,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:33,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:33,174 INFO L87 Difference]: Start difference. First operand 3668 states and 10536 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:33,915 INFO L93 Difference]: Finished difference Result 4828 states and 13445 transitions. [2021-10-05 21:10:33,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:33,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:33,924 INFO L225 Difference]: With dead ends: 4828 [2021-10-05 21:10:33,924 INFO L226 Difference]: Without dead ends: 4820 [2021-10-05 21:10:33,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 268.0ms TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:10:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2021-10-05 21:10:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 3670. [2021-10-05 21:10:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3669 states have (on average 2.871354592532025) internal successors, (10535), 3669 states have internal predecessors, (10535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 10535 transitions. [2021-10-05 21:10:33,992 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 10535 transitions. Word has length 38 [2021-10-05 21:10:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:33,992 INFO L470 AbstractCegarLoop]: Abstraction has 3670 states and 10535 transitions. [2021-10-05 21:10:33,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:33,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 10535 transitions. [2021-10-05 21:10:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:33,998 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:33,999 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:33,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-10-05 21:10:33,999 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1351914315, now seen corresponding path program 86 times [2021-10-05 21:10:33,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:34,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409407485] [2021-10-05 21:10:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:34,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:34,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:34,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409407485] [2021-10-05 21:10:34,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409407485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:34,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:34,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:34,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103678041] [2021-10-05 21:10:34,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:34,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:34,119 INFO L87 Difference]: Start difference. First operand 3670 states and 10535 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:34,948 INFO L93 Difference]: Finished difference Result 4414 states and 12408 transitions. [2021-10-05 21:10:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:34,957 INFO L225 Difference]: With dead ends: 4414 [2021-10-05 21:10:34,957 INFO L226 Difference]: Without dead ends: 4356 [2021-10-05 21:10:34,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 298.8ms TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:10:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4356 states. [2021-10-05 21:10:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4356 to 3622. [2021-10-05 21:10:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3621 states have (on average 2.8784866059099694) internal successors, (10423), 3621 states have internal predecessors, (10423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 10423 transitions. [2021-10-05 21:10:35,024 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 10423 transitions. Word has length 38 [2021-10-05 21:10:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:35,024 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 10423 transitions. [2021-10-05 21:10:35,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 10423 transitions. [2021-10-05 21:10:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:35,030 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:35,030 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:35,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-10-05 21:10:35,030 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash 561007835, now seen corresponding path program 87 times [2021-10-05 21:10:35,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:35,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665664638] [2021-10-05 21:10:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:35,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:35,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:35,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665664638] [2021-10-05 21:10:35,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665664638] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:35,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:35,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:35,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620283907] [2021-10-05 21:10:35,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:35,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:35,168 INFO L87 Difference]: Start difference. First operand 3622 states and 10423 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:35,970 INFO L93 Difference]: Finished difference Result 4364 states and 12167 transitions. [2021-10-05 21:10:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:35,971 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:35,979 INFO L225 Difference]: With dead ends: 4364 [2021-10-05 21:10:35,979 INFO L226 Difference]: Without dead ends: 4190 [2021-10-05 21:10:35,979 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 271.9ms TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:10:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2021-10-05 21:10:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 3730. [2021-10-05 21:10:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3730 states, 3729 states have (on average 2.8608205953338697) internal successors, (10668), 3729 states have internal predecessors, (10668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 10668 transitions. [2021-10-05 21:10:36,043 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 10668 transitions. Word has length 38 [2021-10-05 21:10:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:36,043 INFO L470 AbstractCegarLoop]: Abstraction has 3730 states and 10668 transitions. [2021-10-05 21:10:36,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 10668 transitions. [2021-10-05 21:10:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:36,050 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:36,050 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:36,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-10-05 21:10:36,050 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1470070587, now seen corresponding path program 88 times [2021-10-05 21:10:36,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:36,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96945085] [2021-10-05 21:10:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:36,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:36,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:36,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96945085] [2021-10-05 21:10:36,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96945085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:36,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:36,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:36,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047667342] [2021-10-05 21:10:36,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:36,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:36,205 INFO L87 Difference]: Start difference. First operand 3730 states and 10668 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:37,167 INFO L93 Difference]: Finished difference Result 4632 states and 12900 transitions. [2021-10-05 21:10:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-05 21:10:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:37,176 INFO L225 Difference]: With dead ends: 4632 [2021-10-05 21:10:37,176 INFO L226 Difference]: Without dead ends: 4452 [2021-10-05 21:10:37,176 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 344.6ms TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 21:10:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2021-10-05 21:10:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 3696. [2021-10-05 21:10:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3695 states have (on average 2.8603518267929635) internal successors, (10569), 3695 states have internal predecessors, (10569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 10569 transitions. [2021-10-05 21:10:37,236 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 10569 transitions. Word has length 38 [2021-10-05 21:10:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:37,236 INFO L470 AbstractCegarLoop]: Abstraction has 3696 states and 10569 transitions. [2021-10-05 21:10:37,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 10569 transitions. [2021-10-05 21:10:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:37,242 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:37,242 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:37,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-10-05 21:10:37,242 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash -397895175, now seen corresponding path program 89 times [2021-10-05 21:10:37,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:37,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981506606] [2021-10-05 21:10:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:37,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:37,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:37,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981506606] [2021-10-05 21:10:37,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981506606] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:37,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:37,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:37,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096205424] [2021-10-05 21:10:37,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:37,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:37,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:37,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:37,366 INFO L87 Difference]: Start difference. First operand 3696 states and 10569 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:38,133 INFO L93 Difference]: Finished difference Result 4462 states and 12396 transitions. [2021-10-05 21:10:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-10-05 21:10:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:38,141 INFO L225 Difference]: With dead ends: 4462 [2021-10-05 21:10:38,141 INFO L226 Difference]: Without dead ends: 4382 [2021-10-05 21:10:38,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 256.8ms TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2021-10-05 21:10:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2021-10-05 21:10:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 3696. [2021-10-05 21:10:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3695 states have (on average 2.852232746955345) internal successors, (10539), 3695 states have internal predecessors, (10539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 10539 transitions. [2021-10-05 21:10:38,198 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 10539 transitions. Word has length 38 [2021-10-05 21:10:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:38,198 INFO L470 AbstractCegarLoop]: Abstraction has 3696 states and 10539 transitions. [2021-10-05 21:10:38,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 10539 transitions. [2021-10-05 21:10:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:38,204 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:38,204 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:38,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-10-05 21:10:38,204 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -610538749, now seen corresponding path program 90 times [2021-10-05 21:10:38,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:38,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104660840] [2021-10-05 21:10:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:38,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:38,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:38,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104660840] [2021-10-05 21:10:38,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104660840] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:38,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:38,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:38,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015290636] [2021-10-05 21:10:38,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:38,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:38,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:38,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:38,321 INFO L87 Difference]: Start difference. First operand 3696 states and 10539 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:39,203 INFO L93 Difference]: Finished difference Result 4572 states and 12691 transitions. [2021-10-05 21:10:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-10-05 21:10:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:39,212 INFO L225 Difference]: With dead ends: 4572 [2021-10-05 21:10:39,212 INFO L226 Difference]: Without dead ends: 4522 [2021-10-05 21:10:39,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 312.2ms TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2021-10-05 21:10:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2021-10-05 21:10:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3710. [2021-10-05 21:10:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 3709 states have (on average 2.848207063898625) internal successors, (10564), 3709 states have internal predecessors, (10564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 10564 transitions. [2021-10-05 21:10:39,276 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 10564 transitions. Word has length 38 [2021-10-05 21:10:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:39,276 INFO L470 AbstractCegarLoop]: Abstraction has 3710 states and 10564 transitions. [2021-10-05 21:10:39,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 10564 transitions. [2021-10-05 21:10:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:39,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:39,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:39,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-10-05 21:10:39,283 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:39,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash -241352503, now seen corresponding path program 91 times [2021-10-05 21:10:39,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:39,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045623652] [2021-10-05 21:10:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:39,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:39,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:39,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045623652] [2021-10-05 21:10:39,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045623652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:39,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:39,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:39,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080393855] [2021-10-05 21:10:39,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:39,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:39,405 INFO L87 Difference]: Start difference. First operand 3710 states and 10564 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:40,145 INFO L93 Difference]: Finished difference Result 4886 states and 13501 transitions. [2021-10-05 21:10:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:40,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:40,154 INFO L225 Difference]: With dead ends: 4886 [2021-10-05 21:10:40,155 INFO L226 Difference]: Without dead ends: 4778 [2021-10-05 21:10:40,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 254.5ms TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:10:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2021-10-05 21:10:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 3656. [2021-10-05 21:10:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 3655 states have (on average 2.8538987688098496) internal successors, (10431), 3655 states have internal predecessors, (10431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 10431 transitions. [2021-10-05 21:10:40,218 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 10431 transitions. Word has length 38 [2021-10-05 21:10:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:40,219 INFO L470 AbstractCegarLoop]: Abstraction has 3656 states and 10431 transitions. [2021-10-05 21:10:40,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 10431 transitions. [2021-10-05 21:10:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:40,224 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:40,224 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:40,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-10-05 21:10:40,225 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash 492027739, now seen corresponding path program 92 times [2021-10-05 21:10:40,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:40,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098595904] [2021-10-05 21:10:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:40,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:40,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-10-05 21:10:40,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:40,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098595904] [2021-10-05 21:10:40,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098595904] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:40,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:40,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:40,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90804170] [2021-10-05 21:10:40,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:40,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:40,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:40,349 INFO L87 Difference]: Start difference. First operand 3656 states and 10431 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:41,103 INFO L93 Difference]: Finished difference Result 4108 states and 11691 transitions. [2021-10-05 21:10:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-05 21:10:41,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:41,111 INFO L225 Difference]: With dead ends: 4108 [2021-10-05 21:10:41,111 INFO L226 Difference]: Without dead ends: 4080 [2021-10-05 21:10:41,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 317.8ms TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2021-10-05 21:10:41,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2021-10-05 21:10:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3648. [2021-10-05 21:10:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3647 states have (on average 2.8535782835207018) internal successors, (10407), 3647 states have internal predecessors, (10407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 10407 transitions. [2021-10-05 21:10:41,170 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 10407 transitions. Word has length 38 [2021-10-05 21:10:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:41,170 INFO L470 AbstractCegarLoop]: Abstraction has 3648 states and 10407 transitions. [2021-10-05 21:10:41,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 10407 transitions. [2021-10-05 21:10:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:41,175 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:41,175 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:41,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-10-05 21:10:41,176 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1550112689, now seen corresponding path program 93 times [2021-10-05 21:10:41,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:41,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985621026] [2021-10-05 21:10:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:41,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:41,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:41,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985621026] [2021-10-05 21:10:41,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985621026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:41,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:41,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:41,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027345250] [2021-10-05 21:10:41,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:41,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:41,310 INFO L87 Difference]: Start difference. First operand 3648 states and 10407 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:42,196 INFO L93 Difference]: Finished difference Result 4470 states and 12563 transitions. [2021-10-05 21:10:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:42,197 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:42,205 INFO L225 Difference]: With dead ends: 4470 [2021-10-05 21:10:42,205 INFO L226 Difference]: Without dead ends: 4398 [2021-10-05 21:10:42,206 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 336.0ms TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2021-10-05 21:10:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2021-10-05 21:10:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 3572. [2021-10-05 21:10:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3571 states have (on average 2.859423130775693) internal successors, (10211), 3571 states have internal predecessors, (10211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 10211 transitions. [2021-10-05 21:10:42,268 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 10211 transitions. Word has length 38 [2021-10-05 21:10:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:42,268 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 10211 transitions. [2021-10-05 21:10:42,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 10211 transitions. [2021-10-05 21:10:42,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:42,273 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:42,274 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:42,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-10-05 21:10:42,274 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1298485897, now seen corresponding path program 94 times [2021-10-05 21:10:42,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:42,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399883] [2021-10-05 21:10:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:42,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:42,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:42,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399883] [2021-10-05 21:10:42,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399883] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:42,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:42,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:42,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54028364] [2021-10-05 21:10:42,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:42,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:42,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:42,380 INFO L87 Difference]: Start difference. First operand 3572 states and 10211 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:42,963 INFO L93 Difference]: Finished difference Result 4252 states and 11961 transitions. [2021-10-05 21:10:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:10:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:42,972 INFO L225 Difference]: With dead ends: 4252 [2021-10-05 21:10:42,972 INFO L226 Difference]: Without dead ends: 4244 [2021-10-05 21:10:42,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 193.8ms TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:10:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2021-10-05 21:10:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 3572. [2021-10-05 21:10:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3571 states have (on average 2.858863063567628) internal successors, (10209), 3571 states have internal predecessors, (10209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 10209 transitions. [2021-10-05 21:10:43,035 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 10209 transitions. Word has length 38 [2021-10-05 21:10:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:43,035 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 10209 transitions. [2021-10-05 21:10:43,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 10209 transitions. [2021-10-05 21:10:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:43,041 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:43,041 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:43,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-10-05 21:10:43,041 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1492917861, now seen corresponding path program 95 times [2021-10-05 21:10:43,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:43,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550611075] [2021-10-05 21:10:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:43,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:43,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:43,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550611075] [2021-10-05 21:10:43,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550611075] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:43,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:43,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:43,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353146755] [2021-10-05 21:10:43,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:43,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:43,157 INFO L87 Difference]: Start difference. First operand 3572 states and 10209 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:43,846 INFO L93 Difference]: Finished difference Result 4282 states and 12030 transitions. [2021-10-05 21:10:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-10-05 21:10:43,847 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:43,857 INFO L225 Difference]: With dead ends: 4282 [2021-10-05 21:10:43,857 INFO L226 Difference]: Without dead ends: 4274 [2021-10-05 21:10:43,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 258.3ms TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2021-10-05 21:10:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2021-10-05 21:10:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 3570. [2021-10-05 21:10:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 2.8590641636312695) internal successors, (10204), 3569 states have internal predecessors, (10204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 10204 transitions. [2021-10-05 21:10:43,959 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 10204 transitions. Word has length 38 [2021-10-05 21:10:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:43,959 INFO L470 AbstractCegarLoop]: Abstraction has 3570 states and 10204 transitions. [2021-10-05 21:10:43,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 10204 transitions. [2021-10-05 21:10:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:43,970 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:43,971 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:43,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-10-05 21:10:43,971 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1556353137, now seen corresponding path program 96 times [2021-10-05 21:10:43,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:43,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423934044] [2021-10-05 21:10:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:43,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:44,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:44,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423934044] [2021-10-05 21:10:44,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423934044] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:44,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:44,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:44,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675985970] [2021-10-05 21:10:44,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:44,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:44,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:44,103 INFO L87 Difference]: Start difference. First operand 3570 states and 10204 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:44,658 INFO L93 Difference]: Finished difference Result 4296 states and 12024 transitions. [2021-10-05 21:10:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 21:10:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:44,666 INFO L225 Difference]: With dead ends: 4296 [2021-10-05 21:10:44,666 INFO L226 Difference]: Without dead ends: 4288 [2021-10-05 21:10:44,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 183.8ms TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:10:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2021-10-05 21:10:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3572. [2021-10-05 21:10:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 3571 states have (on average 2.858302996359563) internal successors, (10207), 3571 states have internal predecessors, (10207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 10207 transitions. [2021-10-05 21:10:44,723 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 10207 transitions. Word has length 38 [2021-10-05 21:10:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:44,724 INFO L470 AbstractCegarLoop]: Abstraction has 3572 states and 10207 transitions. [2021-10-05 21:10:44,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 10207 transitions. [2021-10-05 21:10:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:44,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:44,729 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:44,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-10-05 21:10:44,730 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:44,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1731107419, now seen corresponding path program 97 times [2021-10-05 21:10:44,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:44,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071187869] [2021-10-05 21:10:44,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:44,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:44,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:44,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071187869] [2021-10-05 21:10:44,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071187869] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:44,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:44,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:44,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791101467] [2021-10-05 21:10:44,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:44,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:44,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:44,846 INFO L87 Difference]: Start difference. First operand 3572 states and 10207 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:45,460 INFO L93 Difference]: Finished difference Result 4370 states and 12182 transitions. [2021-10-05 21:10:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:10:45,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:45,473 INFO L225 Difference]: With dead ends: 4370 [2021-10-05 21:10:45,473 INFO L226 Difference]: Without dead ends: 4350 [2021-10-05 21:10:45,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 188.4ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:10:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2021-10-05 21:10:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 3570. [2021-10-05 21:10:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 2.858503782572149) internal successors, (10202), 3569 states have internal predecessors, (10202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 10202 transitions. [2021-10-05 21:10:45,542 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 10202 transitions. Word has length 38 [2021-10-05 21:10:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:45,542 INFO L470 AbstractCegarLoop]: Abstraction has 3570 states and 10202 transitions. [2021-10-05 21:10:45,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 10202 transitions. [2021-10-05 21:10:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:45,547 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:45,547 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:45,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-10-05 21:10:45,548 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash -370502415, now seen corresponding path program 98 times [2021-10-05 21:10:45,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:45,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344986807] [2021-10-05 21:10:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:45,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:45,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:45,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344986807] [2021-10-05 21:10:45,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344986807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:45,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:45,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:45,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735249700] [2021-10-05 21:10:45,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:45,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:45,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:45,670 INFO L87 Difference]: Start difference. First operand 3570 states and 10202 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:46,394 INFO L93 Difference]: Finished difference Result 4358 states and 12193 transitions. [2021-10-05 21:10:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-05 21:10:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:46,402 INFO L225 Difference]: With dead ends: 4358 [2021-10-05 21:10:46,403 INFO L226 Difference]: Without dead ends: 4296 [2021-10-05 21:10:46,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 294.8ms TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2021-10-05 21:10:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2021-10-05 21:10:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3526. [2021-10-05 21:10:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 2.8686524822695034) internal successors, (10112), 3525 states have internal predecessors, (10112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 10112 transitions. [2021-10-05 21:10:46,463 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 10112 transitions. Word has length 38 [2021-10-05 21:10:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:46,463 INFO L470 AbstractCegarLoop]: Abstraction has 3526 states and 10112 transitions. [2021-10-05 21:10:46,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 10112 transitions. [2021-10-05 21:10:46,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:46,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:46,469 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:46,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-10-05 21:10:46,469 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:46,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash 935820881, now seen corresponding path program 99 times [2021-10-05 21:10:46,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:46,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938124277] [2021-10-05 21:10:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:46,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:46,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:46,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938124277] [2021-10-05 21:10:46,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938124277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:46,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:46,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 21:10:46,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789684098] [2021-10-05 21:10:46,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-05 21:10:46,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-05 21:10:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-05 21:10:46,585 INFO L87 Difference]: Start difference. First operand 3526 states and 10112 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:46,667 INFO L93 Difference]: Finished difference Result 4551 states and 13008 transitions. [2021-10-05 21:10:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-05 21:10:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:46,675 INFO L225 Difference]: With dead ends: 4551 [2021-10-05 21:10:46,676 INFO L226 Difference]: Without dead ends: 2894 [2021-10-05 21:10:46,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:10:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2021-10-05 21:10:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2894. [2021-10-05 21:10:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2893 states have (on average 2.7500864154856552) internal successors, (7956), 2893 states have internal predecessors, (7956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 7956 transitions. [2021-10-05 21:10:46,741 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 7956 transitions. Word has length 38 [2021-10-05 21:10:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:46,741 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 7956 transitions. [2021-10-05 21:10:46,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 7956 transitions. [2021-10-05 21:10:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:46,747 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:46,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:46,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-10-05 21:10:46,747 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash 452241967, now seen corresponding path program 100 times [2021-10-05 21:10:46,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:46,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106556009] [2021-10-05 21:10:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:46,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:46,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:46,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106556009] [2021-10-05 21:10:46,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106556009] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:46,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:46,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:46,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724618431] [2021-10-05 21:10:46,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:46,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:46,863 INFO L87 Difference]: Start difference. First operand 2894 states and 7956 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:47,339 INFO L93 Difference]: Finished difference Result 3128 states and 8520 transitions. [2021-10-05 21:10:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:10:47,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:47,344 INFO L225 Difference]: With dead ends: 3128 [2021-10-05 21:10:47,345 INFO L226 Difference]: Without dead ends: 3006 [2021-10-05 21:10:47,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 148.8ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:10:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2021-10-05 21:10:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2976. [2021-10-05 21:10:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2975 states have (on average 2.73781512605042) internal successors, (8145), 2975 states have internal predecessors, (8145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 8145 transitions. [2021-10-05 21:10:47,396 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 8145 transitions. Word has length 38 [2021-10-05 21:10:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:47,397 INFO L470 AbstractCegarLoop]: Abstraction has 2976 states and 8145 transitions. [2021-10-05 21:10:47,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 8145 transitions. [2021-10-05 21:10:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:47,402 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:47,402 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:47,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-10-05 21:10:47,402 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1555325439, now seen corresponding path program 101 times [2021-10-05 21:10:47,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:47,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688054375] [2021-10-05 21:10:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:47,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:47,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:47,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688054375] [2021-10-05 21:10:47,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688054375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:47,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:47,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 21:10:47,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524632622] [2021-10-05 21:10:47,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:10:47,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:10:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:10:47,514 INFO L87 Difference]: Start difference. First operand 2976 states and 8145 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:47,696 INFO L93 Difference]: Finished difference Result 1576 states and 3966 transitions. [2021-10-05 21:10:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:10:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:47,699 INFO L225 Difference]: With dead ends: 1576 [2021-10-05 21:10:47,699 INFO L226 Difference]: Without dead ends: 1068 [2021-10-05 21:10:47,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-10-05 21:10:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1036. [2021-10-05 21:10:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 2.5304347826086957) internal successors, (2619), 1035 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2619 transitions. [2021-10-05 21:10:47,712 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2619 transitions. Word has length 38 [2021-10-05 21:10:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:47,712 INFO L470 AbstractCegarLoop]: Abstraction has 1036 states and 2619 transitions. [2021-10-05 21:10:47,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2619 transitions. [2021-10-05 21:10:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:47,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:47,714 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:47,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-10-05 21:10:47,714 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:47,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1905128041, now seen corresponding path program 102 times [2021-10-05 21:10:47,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:47,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4219279] [2021-10-05 21:10:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:47,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:47,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:47,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4219279] [2021-10-05 21:10:47,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4219279] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:47,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:47,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:47,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028650018] [2021-10-05 21:10:47,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:47,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:47,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:47,870 INFO L87 Difference]: Start difference. First operand 1036 states and 2619 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:48,253 INFO L93 Difference]: Finished difference Result 1202 states and 2921 transitions. [2021-10-05 21:10:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:10:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:48,256 INFO L225 Difference]: With dead ends: 1202 [2021-10-05 21:10:48,256 INFO L226 Difference]: Without dead ends: 1132 [2021-10-05 21:10:48,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 169.2ms TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:10:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2021-10-05 21:10:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1078. [2021-10-05 21:10:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 2.500464252553389) internal successors, (2693), 1077 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2693 transitions. [2021-10-05 21:10:48,269 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2693 transitions. Word has length 38 [2021-10-05 21:10:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:48,269 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 2693 transitions. [2021-10-05 21:10:48,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2693 transitions. [2021-10-05 21:10:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:48,271 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:48,271 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:48,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-10-05 21:10:48,271 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:48,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1857730595, now seen corresponding path program 103 times [2021-10-05 21:10:48,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:48,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652348498] [2021-10-05 21:10:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:48,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:48,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:48,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652348498] [2021-10-05 21:10:48,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652348498] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:48,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:48,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:48,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136830850] [2021-10-05 21:10:48,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:48,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:48,390 INFO L87 Difference]: Start difference. First operand 1078 states and 2693 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:48,833 INFO L93 Difference]: Finished difference Result 1308 states and 3145 transitions. [2021-10-05 21:10:48,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:10:48,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:48,838 INFO L225 Difference]: With dead ends: 1308 [2021-10-05 21:10:48,838 INFO L226 Difference]: Without dead ends: 1244 [2021-10-05 21:10:48,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 143.7ms TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:10:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2021-10-05 21:10:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1086. [2021-10-05 21:10:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 2.496774193548387) internal successors, (2709), 1085 states have internal predecessors, (2709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2709 transitions. [2021-10-05 21:10:48,853 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2709 transitions. Word has length 38 [2021-10-05 21:10:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:48,853 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 2709 transitions. [2021-10-05 21:10:48,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2709 transitions. [2021-10-05 21:10:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:48,855 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:48,855 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:48,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-10-05 21:10:48,855 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:48,856 INFO L82 PathProgramCache]: Analyzing trace with hash -239549283, now seen corresponding path program 104 times [2021-10-05 21:10:48,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:48,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626757124] [2021-10-05 21:10:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:48,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:48,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:48,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626757124] [2021-10-05 21:10:48,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626757124] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:48,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:48,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:48,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735032696] [2021-10-05 21:10:48,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:48,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:48,973 INFO L87 Difference]: Start difference. First operand 1086 states and 2709 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:49,456 INFO L93 Difference]: Finished difference Result 1462 states and 3570 transitions. [2021-10-05 21:10:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:10:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:49,461 INFO L225 Difference]: With dead ends: 1462 [2021-10-05 21:10:49,462 INFO L226 Difference]: Without dead ends: 1400 [2021-10-05 21:10:49,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 147.9ms TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:10:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2021-10-05 21:10:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1146. [2021-10-05 21:10:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 2.504803493449782) internal successors, (2868), 1145 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2868 transitions. [2021-10-05 21:10:49,489 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2868 transitions. Word has length 38 [2021-10-05 21:10:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:49,490 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 2868 transitions. [2021-10-05 21:10:49,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2868 transitions. [2021-10-05 21:10:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:49,493 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:49,493 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:49,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-10-05 21:10:49,494 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1655925631, now seen corresponding path program 105 times [2021-10-05 21:10:49,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:49,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543575499] [2021-10-05 21:10:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:49,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:49,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:49,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543575499] [2021-10-05 21:10:49,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543575499] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:49,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:49,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:49,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167158685] [2021-10-05 21:10:49,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:49,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:49,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:49,633 INFO L87 Difference]: Start difference. First operand 1146 states and 2868 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:50,156 INFO L93 Difference]: Finished difference Result 1468 states and 3582 transitions. [2021-10-05 21:10:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:10:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:50,159 INFO L225 Difference]: With dead ends: 1468 [2021-10-05 21:10:50,159 INFO L226 Difference]: Without dead ends: 1418 [2021-10-05 21:10:50,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 179.1ms TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:10:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2021-10-05 21:10:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1180. [2021-10-05 21:10:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 2.508905852417303) internal successors, (2958), 1179 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 2958 transitions. [2021-10-05 21:10:50,175 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 2958 transitions. Word has length 38 [2021-10-05 21:10:50,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:50,175 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 2958 transitions. [2021-10-05 21:10:50,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 2958 transitions. [2021-10-05 21:10:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:50,177 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:50,177 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:50,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-10-05 21:10:50,178 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1109508985, now seen corresponding path program 106 times [2021-10-05 21:10:50,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:50,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689574494] [2021-10-05 21:10:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:50,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:50,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:50,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689574494] [2021-10-05 21:10:50,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689574494] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:50,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:50,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:50,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498712969] [2021-10-05 21:10:50,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:50,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:50,311 INFO L87 Difference]: Start difference. First operand 1180 states and 2958 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:50,728 INFO L93 Difference]: Finished difference Result 1540 states and 3716 transitions. [2021-10-05 21:10:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:10:50,728 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:50,731 INFO L225 Difference]: With dead ends: 1540 [2021-10-05 21:10:50,731 INFO L226 Difference]: Without dead ends: 1420 [2021-10-05 21:10:50,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 153.4ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:10:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-10-05 21:10:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1136. [2021-10-05 21:10:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 2.5066079295154187) internal successors, (2845), 1135 states have internal predecessors, (2845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2845 transitions. [2021-10-05 21:10:50,751 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2845 transitions. Word has length 38 [2021-10-05 21:10:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:50,752 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 2845 transitions. [2021-10-05 21:10:50,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2845 transitions. [2021-10-05 21:10:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:50,754 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:50,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:50,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-10-05 21:10:50,754 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash 957344373, now seen corresponding path program 107 times [2021-10-05 21:10:50,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:50,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98828120] [2021-10-05 21:10:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:50,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:50,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:50,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98828120] [2021-10-05 21:10:50,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98828120] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:50,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:50,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:50,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652635010] [2021-10-05 21:10:50,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:50,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:50,892 INFO L87 Difference]: Start difference. First operand 1136 states and 2845 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:51,217 INFO L93 Difference]: Finished difference Result 1186 states and 2934 transitions. [2021-10-05 21:10:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:10:51,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:51,220 INFO L225 Difference]: With dead ends: 1186 [2021-10-05 21:10:51,220 INFO L226 Difference]: Without dead ends: 1158 [2021-10-05 21:10:51,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 144.6ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:10:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2021-10-05 21:10:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1146. [2021-10-05 21:10:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 2.496069868995633) internal successors, (2858), 1145 states have internal predecessors, (2858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2858 transitions. [2021-10-05 21:10:51,235 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2858 transitions. Word has length 38 [2021-10-05 21:10:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:51,235 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 2858 transitions. [2021-10-05 21:10:51,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2858 transitions. [2021-10-05 21:10:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:51,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:51,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:51,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-10-05 21:10:51,237 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 415059757, now seen corresponding path program 108 times [2021-10-05 21:10:51,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:51,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052753340] [2021-10-05 21:10:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:51,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:51,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:51,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052753340] [2021-10-05 21:10:51,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052753340] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:51,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:51,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:51,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346380487] [2021-10-05 21:10:51,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:51,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:51,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:51,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:51,340 INFO L87 Difference]: Start difference. First operand 1146 states and 2858 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:51,697 INFO L93 Difference]: Finished difference Result 1316 states and 3241 transitions. [2021-10-05 21:10:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:10:51,698 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:51,701 INFO L225 Difference]: With dead ends: 1316 [2021-10-05 21:10:51,701 INFO L226 Difference]: Without dead ends: 1296 [2021-10-05 21:10:51,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 120.1ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:10:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2021-10-05 21:10:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1168. [2021-10-05 21:10:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 2.4961439588688945) internal successors, (2913), 1167 states have internal predecessors, (2913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 2913 transitions. [2021-10-05 21:10:51,725 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 2913 transitions. Word has length 38 [2021-10-05 21:10:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:51,726 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 2913 transitions. [2021-10-05 21:10:51,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 2913 transitions. [2021-10-05 21:10:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:51,728 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:51,728 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:51,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-10-05 21:10:51,729 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1811798207, now seen corresponding path program 109 times [2021-10-05 21:10:51,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:51,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620450985] [2021-10-05 21:10:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:51,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:51,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:51,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620450985] [2021-10-05 21:10:51,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620450985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:51,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:51,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:51,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70192295] [2021-10-05 21:10:51,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:51,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:51,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:51,860 INFO L87 Difference]: Start difference. First operand 1168 states and 2913 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:52,219 INFO L93 Difference]: Finished difference Result 1320 states and 3250 transitions. [2021-10-05 21:10:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:10:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:52,223 INFO L225 Difference]: With dead ends: 1320 [2021-10-05 21:10:52,223 INFO L226 Difference]: Without dead ends: 1310 [2021-10-05 21:10:52,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 142.2ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:10:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2021-10-05 21:10:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1174. [2021-10-05 21:10:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 2.4927536231884058) internal successors, (2924), 1173 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 2924 transitions. [2021-10-05 21:10:52,239 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 2924 transitions. Word has length 38 [2021-10-05 21:10:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:52,240 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 2924 transitions. [2021-10-05 21:10:52,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 2924 transitions. [2021-10-05 21:10:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:52,242 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:52,242 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:52,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-10-05 21:10:52,242 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1220533751, now seen corresponding path program 110 times [2021-10-05 21:10:52,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:52,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937092760] [2021-10-05 21:10:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:52,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:52,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-10-05 21:10:52,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:52,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937092760] [2021-10-05 21:10:52,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937092760] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:52,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:52,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:52,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126786695] [2021-10-05 21:10:52,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:52,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:52,374 INFO L87 Difference]: Start difference. First operand 1174 states and 2924 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:52,722 INFO L93 Difference]: Finished difference Result 1402 states and 3401 transitions. [2021-10-05 21:10:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:10:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:52,726 INFO L225 Difference]: With dead ends: 1402 [2021-10-05 21:10:52,726 INFO L226 Difference]: Without dead ends: 1378 [2021-10-05 21:10:52,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 143.7ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:10:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2021-10-05 21:10:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1158. [2021-10-05 21:10:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 2.497839239412273) internal successors, (2890), 1157 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2890 transitions. [2021-10-05 21:10:52,744 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2890 transitions. Word has length 38 [2021-10-05 21:10:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:52,744 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 2890 transitions. [2021-10-05 21:10:52,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2890 transitions. [2021-10-05 21:10:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:52,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:52,746 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:52,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-10-05 21:10:52,746 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash 628033821, now seen corresponding path program 111 times [2021-10-05 21:10:52,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:52,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302779633] [2021-10-05 21:10:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:52,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:52,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:52,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302779633] [2021-10-05 21:10:52,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302779633] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:52,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:52,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:52,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523967979] [2021-10-05 21:10:52,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:52,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:52,853 INFO L87 Difference]: Start difference. First operand 1158 states and 2890 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:53,246 INFO L93 Difference]: Finished difference Result 1246 states and 3068 transitions. [2021-10-05 21:10:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:10:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:53,250 INFO L225 Difference]: With dead ends: 1246 [2021-10-05 21:10:53,250 INFO L226 Difference]: Without dead ends: 1216 [2021-10-05 21:10:53,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 133.4ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:10:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2021-10-05 21:10:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1150. [2021-10-05 21:10:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 2.4995648389904264) internal successors, (2872), 1149 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 2872 transitions. [2021-10-05 21:10:53,266 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 2872 transitions. Word has length 38 [2021-10-05 21:10:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:53,266 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 2872 transitions. [2021-10-05 21:10:53,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 2872 transitions. [2021-10-05 21:10:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:53,268 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:53,268 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:53,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-10-05 21:10:53,268 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:53,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:53,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1884380583, now seen corresponding path program 112 times [2021-10-05 21:10:53,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:53,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738795627] [2021-10-05 21:10:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:53,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:53,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-10-05 21:10:53,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:53,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738795627] [2021-10-05 21:10:53,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738795627] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:53,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:53,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:53,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724947061] [2021-10-05 21:10:53,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:53,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:53,369 INFO L87 Difference]: Start difference. First operand 1150 states and 2872 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:53,766 INFO L93 Difference]: Finished difference Result 1510 states and 3738 transitions. [2021-10-05 21:10:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:10:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:53,770 INFO L225 Difference]: With dead ends: 1510 [2021-10-05 21:10:53,770 INFO L226 Difference]: Without dead ends: 1490 [2021-10-05 21:10:53,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 162.7ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:10:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2021-10-05 21:10:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1178. [2021-10-05 21:10:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 2.503823279524214) internal successors, (2947), 1177 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 2947 transitions. [2021-10-05 21:10:53,786 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 2947 transitions. Word has length 38 [2021-10-05 21:10:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:53,786 INFO L470 AbstractCegarLoop]: Abstraction has 1178 states and 2947 transitions. [2021-10-05 21:10:53,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 2947 transitions. [2021-10-05 21:10:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:53,788 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:53,788 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:53,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-10-05 21:10:53,788 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1013848263, now seen corresponding path program 113 times [2021-10-05 21:10:53,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:53,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567938699] [2021-10-05 21:10:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:53,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:53,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:53,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567938699] [2021-10-05 21:10:53,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567938699] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:53,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:53,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:53,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230131673] [2021-10-05 21:10:53,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:53,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:53,892 INFO L87 Difference]: Start difference. First operand 1178 states and 2947 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:54,219 INFO L93 Difference]: Finished difference Result 1484 states and 3681 transitions. [2021-10-05 21:10:54,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:10:54,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:54,222 INFO L225 Difference]: With dead ends: 1484 [2021-10-05 21:10:54,223 INFO L226 Difference]: Without dead ends: 1474 [2021-10-05 21:10:54,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 123.0ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:10:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2021-10-05 21:10:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1184. [2021-10-05 21:10:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 2.500422654268808) internal successors, (2958), 1183 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2958 transitions. [2021-10-05 21:10:54,244 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2958 transitions. Word has length 38 [2021-10-05 21:10:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:54,244 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2958 transitions. [2021-10-05 21:10:54,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2958 transitions. [2021-10-05 21:10:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:54,246 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:54,246 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:54,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-10-05 21:10:54,246 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:54,247 INFO L82 PathProgramCache]: Analyzing trace with hash 248787075, now seen corresponding path program 114 times [2021-10-05 21:10:54,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:54,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799192266] [2021-10-05 21:10:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:54,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:54,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-10-05 21:10:54,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:54,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799192266] [2021-10-05 21:10:54,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799192266] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:54,356 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:54,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:54,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442548803] [2021-10-05 21:10:54,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:54,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:54,358 INFO L87 Difference]: Start difference. First operand 1184 states and 2958 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:54,682 INFO L93 Difference]: Finished difference Result 1872 states and 4555 transitions. [2021-10-05 21:10:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:10:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:54,687 INFO L225 Difference]: With dead ends: 1872 [2021-10-05 21:10:54,687 INFO L226 Difference]: Without dead ends: 1848 [2021-10-05 21:10:54,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 120.0ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:10:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2021-10-05 21:10:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1200. [2021-10-05 21:10:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1199 states have (on average 2.517931609674729) internal successors, (3019), 1199 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3019 transitions. [2021-10-05 21:10:54,712 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3019 transitions. Word has length 38 [2021-10-05 21:10:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:54,712 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 3019 transitions. [2021-10-05 21:10:54,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3019 transitions. [2021-10-05 21:10:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:54,714 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:54,714 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:54,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-10-05 21:10:54,714 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2097354647, now seen corresponding path program 115 times [2021-10-05 21:10:54,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:54,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520763667] [2021-10-05 21:10:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:54,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:54,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:54,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520763667] [2021-10-05 21:10:54,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520763667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:54,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:54,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:54,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563393480] [2021-10-05 21:10:54,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:54,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:54,812 INFO L87 Difference]: Start difference. First operand 1200 states and 3019 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:55,194 INFO L93 Difference]: Finished difference Result 1338 states and 3301 transitions. [2021-10-05 21:10:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:10:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:55,197 INFO L225 Difference]: With dead ends: 1338 [2021-10-05 21:10:55,197 INFO L226 Difference]: Without dead ends: 1314 [2021-10-05 21:10:55,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 168.0ms TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:10:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2021-10-05 21:10:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1196. [2021-10-05 21:10:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 2.517991631799163) internal successors, (3009), 1195 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 3009 transitions. [2021-10-05 21:10:55,212 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 3009 transitions. Word has length 38 [2021-10-05 21:10:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:55,212 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 3009 transitions. [2021-10-05 21:10:55,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 3009 transitions. [2021-10-05 21:10:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:55,215 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:55,215 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:55,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-10-05 21:10:55,215 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:55,215 INFO L82 PathProgramCache]: Analyzing trace with hash 508393703, now seen corresponding path program 116 times [2021-10-05 21:10:55,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:55,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146040884] [2021-10-05 21:10:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:55,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:55,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:55,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146040884] [2021-10-05 21:10:55,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146040884] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:55,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:55,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:10:55,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535912395] [2021-10-05 21:10:55,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:10:55,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:55,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:10:55,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:10:55,302 INFO L87 Difference]: Start difference. First operand 1196 states and 3009 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:55,675 INFO L93 Difference]: Finished difference Result 1670 states and 4187 transitions. [2021-10-05 21:10:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:10:55,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:55,678 INFO L225 Difference]: With dead ends: 1670 [2021-10-05 21:10:55,678 INFO L226 Difference]: Without dead ends: 1650 [2021-10-05 21:10:55,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 115.3ms TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:10:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2021-10-05 21:10:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1196. [2021-10-05 21:10:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 2.509623430962343) internal successors, (2999), 1195 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2999 transitions. [2021-10-05 21:10:55,694 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2999 transitions. Word has length 38 [2021-10-05 21:10:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:55,695 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 2999 transitions. [2021-10-05 21:10:55,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2999 transitions. [2021-10-05 21:10:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:55,697 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:55,697 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:55,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-10-05 21:10:55,697 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1905132153, now seen corresponding path program 117 times [2021-10-05 21:10:55,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:55,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132238601] [2021-10-05 21:10:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:55,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:55,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:55,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132238601] [2021-10-05 21:10:55,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132238601] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:55,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:55,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:55,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641278727] [2021-10-05 21:10:55,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:55,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:55,816 INFO L87 Difference]: Start difference. First operand 1196 states and 2999 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:56,174 INFO L93 Difference]: Finished difference Result 1912 states and 4677 transitions. [2021-10-05 21:10:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:10:56,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:56,180 INFO L225 Difference]: With dead ends: 1912 [2021-10-05 21:10:56,180 INFO L226 Difference]: Without dead ends: 1886 [2021-10-05 21:10:56,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 132.4ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:10:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2021-10-05 21:10:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1172. [2021-10-05 21:10:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 2.508112724167378) internal successors, (2937), 1171 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 2937 transitions. [2021-10-05 21:10:56,211 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 2937 transitions. Word has length 38 [2021-10-05 21:10:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:56,212 INFO L470 AbstractCegarLoop]: Abstraction has 1172 states and 2937 transitions. [2021-10-05 21:10:56,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 2937 transitions. [2021-10-05 21:10:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:56,215 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:56,215 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:56,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-10-05 21:10:56,215 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1955418217, now seen corresponding path program 118 times [2021-10-05 21:10:56,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:56,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706048578] [2021-10-05 21:10:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:56,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:56,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-10-05 21:10:56,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:56,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706048578] [2021-10-05 21:10:56,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706048578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:56,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:56,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:56,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138921983] [2021-10-05 21:10:56,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:56,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:56,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:56,344 INFO L87 Difference]: Start difference. First operand 1172 states and 2937 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:56,797 INFO L93 Difference]: Finished difference Result 1772 states and 4363 transitions. [2021-10-05 21:10:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:10:56,798 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:56,802 INFO L225 Difference]: With dead ends: 1772 [2021-10-05 21:10:56,802 INFO L226 Difference]: Without dead ends: 1710 [2021-10-05 21:10:56,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 136.4ms TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:10:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-10-05 21:10:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1248. [2021-10-05 21:10:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 2.5212510024057737) internal successors, (3144), 1247 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 3144 transitions. [2021-10-05 21:10:56,834 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 3144 transitions. Word has length 38 [2021-10-05 21:10:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:56,834 INFO L470 AbstractCegarLoop]: Abstraction has 1248 states and 3144 transitions. [2021-10-05 21:10:56,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 3144 transitions. [2021-10-05 21:10:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:56,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:56,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:56,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-10-05 21:10:56,837 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -59943303, now seen corresponding path program 119 times [2021-10-05 21:10:56,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:56,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347239412] [2021-10-05 21:10:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:56,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:56,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:56,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347239412] [2021-10-05 21:10:56,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347239412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:56,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:56,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:56,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913478589] [2021-10-05 21:10:56,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:56,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:56,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:56,946 INFO L87 Difference]: Start difference. First operand 1248 states and 3144 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:57,412 INFO L93 Difference]: Finished difference Result 1976 states and 4760 transitions. [2021-10-05 21:10:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:10:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:57,416 INFO L225 Difference]: With dead ends: 1976 [2021-10-05 21:10:57,416 INFO L226 Difference]: Without dead ends: 1830 [2021-10-05 21:10:57,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 152.1ms TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:10:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2021-10-05 21:10:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1188. [2021-10-05 21:10:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 2.5046335299073292) internal successors, (2973), 1187 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 2973 transitions. [2021-10-05 21:10:57,434 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 2973 transitions. Word has length 38 [2021-10-05 21:10:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:57,434 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 2973 transitions. [2021-10-05 21:10:57,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 2973 transitions. [2021-10-05 21:10:57,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:57,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:57,437 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:57,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-10-05 21:10:57,438 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash 535312343, now seen corresponding path program 120 times [2021-10-05 21:10:57,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:57,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047977032] [2021-10-05 21:10:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:57,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:57,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:57,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047977032] [2021-10-05 21:10:57,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047977032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:57,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:57,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:57,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493660215] [2021-10-05 21:10:57,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:57,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:57,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:57,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:57,536 INFO L87 Difference]: Start difference. First operand 1188 states and 2973 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:57,945 INFO L93 Difference]: Finished difference Result 1810 states and 4421 transitions. [2021-10-05 21:10:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:10:57,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:57,949 INFO L225 Difference]: With dead ends: 1810 [2021-10-05 21:10:57,949 INFO L226 Difference]: Without dead ends: 1794 [2021-10-05 21:10:57,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 130.0ms TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:10:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2021-10-05 21:10:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1192. [2021-10-05 21:10:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 2.5054575986565912) internal successors, (2984), 1191 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2984 transitions. [2021-10-05 21:10:57,967 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2984 transitions. Word has length 38 [2021-10-05 21:10:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:57,967 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 2984 transitions. [2021-10-05 21:10:57,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2984 transitions. [2021-10-05 21:10:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:57,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:57,969 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:57,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-10-05 21:10:57,969 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash 289275687, now seen corresponding path program 121 times [2021-10-05 21:10:57,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:57,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634839856] [2021-10-05 21:10:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:57,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:58,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:58,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634839856] [2021-10-05 21:10:58,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634839856] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:58,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:58,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:10:58,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703335681] [2021-10-05 21:10:58,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:10:58,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:10:58,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:10:58,080 INFO L87 Difference]: Start difference. First operand 1192 states and 2984 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:58,599 INFO L93 Difference]: Finished difference Result 1872 states and 4538 transitions. [2021-10-05 21:10:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:10:58,600 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:58,603 INFO L225 Difference]: With dead ends: 1872 [2021-10-05 21:10:58,603 INFO L226 Difference]: Without dead ends: 1830 [2021-10-05 21:10:58,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 169.6ms TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:10:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2021-10-05 21:10:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1192. [2021-10-05 21:10:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 2.502099076406381) internal successors, (2980), 1191 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2980 transitions. [2021-10-05 21:10:58,621 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2980 transitions. Word has length 38 [2021-10-05 21:10:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:58,622 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 2980 transitions. [2021-10-05 21:10:58,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2980 transitions. [2021-10-05 21:10:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:58,624 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:58,624 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:58,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-10-05 21:10:58,624 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:58,625 INFO L82 PathProgramCache]: Analyzing trace with hash 229848855, now seen corresponding path program 122 times [2021-10-05 21:10:58,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:58,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526304529] [2021-10-05 21:10:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:58,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:58,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:58,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526304529] [2021-10-05 21:10:58,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526304529] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:58,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:58,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:58,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568729588] [2021-10-05 21:10:58,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:58,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:58,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:58,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:58,729 INFO L87 Difference]: Start difference. First operand 1192 states and 2980 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:59,117 INFO L93 Difference]: Finished difference Result 1846 states and 4490 transitions. [2021-10-05 21:10:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:10:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:59,120 INFO L225 Difference]: With dead ends: 1846 [2021-10-05 21:10:59,120 INFO L226 Difference]: Without dead ends: 1802 [2021-10-05 21:10:59,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 124.7ms TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:10:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-10-05 21:10:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1176. [2021-10-05 21:10:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 2.508936170212766) internal successors, (2948), 1175 states have internal predecessors, (2948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 2948 transitions. [2021-10-05 21:10:59,138 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 2948 transitions. Word has length 38 [2021-10-05 21:10:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:59,139 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 2948 transitions. [2021-10-05 21:10:59,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 2948 transitions. [2021-10-05 21:10:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:59,140 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:59,141 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:59,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-10-05 21:10:59,141 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1266370841, now seen corresponding path program 123 times [2021-10-05 21:10:59,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:59,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921344520] [2021-10-05 21:10:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:59,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:59,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:59,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921344520] [2021-10-05 21:10:59,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921344520] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:59,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:59,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:59,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753239057] [2021-10-05 21:10:59,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:59,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:59,253 INFO L87 Difference]: Start difference. First operand 1176 states and 2948 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:10:59,738 INFO L93 Difference]: Finished difference Result 1422 states and 3434 transitions. [2021-10-05 21:10:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:10:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:10:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:10:59,741 INFO L225 Difference]: With dead ends: 1422 [2021-10-05 21:10:59,741 INFO L226 Difference]: Without dead ends: 1358 [2021-10-05 21:10:59,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 194.9ms TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:10:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-10-05 21:10:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1184. [2021-10-05 21:10:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 2.5054945054945055) internal successors, (2964), 1183 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2964 transitions. [2021-10-05 21:10:59,764 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2964 transitions. Word has length 38 [2021-10-05 21:10:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:10:59,764 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 2964 transitions. [2021-10-05 21:10:59,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:10:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2964 transitions. [2021-10-05 21:10:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:10:59,766 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:10:59,766 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:10:59,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-10-05 21:10:59,766 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:10:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:10:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash 351810471, now seen corresponding path program 124 times [2021-10-05 21:10:59,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:10:59,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209866262] [2021-10-05 21:10:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:10:59,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:10:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:10:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:10:59,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:10:59,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209866262] [2021-10-05 21:10:59,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209866262] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:10:59,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:10:59,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:10:59,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962034599] [2021-10-05 21:10:59,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:10:59,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:10:59,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:10:59,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:10:59,880 INFO L87 Difference]: Start difference. First operand 1184 states and 2964 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:00,403 INFO L93 Difference]: Finished difference Result 1642 states and 3994 transitions. [2021-10-05 21:11:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:11:00,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:00,406 INFO L225 Difference]: With dead ends: 1642 [2021-10-05 21:11:00,406 INFO L226 Difference]: Without dead ends: 1580 [2021-10-05 21:11:00,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 202.0ms TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:11:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2021-10-05 21:11:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1244. [2021-10-05 21:11:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1243 states have (on average 2.512469831053902) internal successors, (3123), 1243 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3123 transitions. [2021-10-05 21:11:00,425 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3123 transitions. Word has length 38 [2021-10-05 21:11:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:00,425 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 3123 transitions. [2021-10-05 21:11:00,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3123 transitions. [2021-10-05 21:11:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:00,427 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:00,427 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:00,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-10-05 21:11:00,428 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2047681911, now seen corresponding path program 125 times [2021-10-05 21:11:00,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:00,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950566635] [2021-10-05 21:11:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:00,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:00,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:00,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950566635] [2021-10-05 21:11:00,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950566635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:00,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:00,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:00,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87518773] [2021-10-05 21:11:00,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:00,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:00,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:00,543 INFO L87 Difference]: Start difference. First operand 1244 states and 3123 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:01,040 INFO L93 Difference]: Finished difference Result 1586 states and 3866 transitions. [2021-10-05 21:11:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:11:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:01,043 INFO L225 Difference]: With dead ends: 1586 [2021-10-05 21:11:01,043 INFO L226 Difference]: Without dead ends: 1536 [2021-10-05 21:11:01,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 177.3ms TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-10-05 21:11:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1278. [2021-10-05 21:11:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 2.5160532498042287) internal successors, (3213), 1277 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 3213 transitions. [2021-10-05 21:11:01,059 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 3213 transitions. Word has length 38 [2021-10-05 21:11:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:01,059 INFO L470 AbstractCegarLoop]: Abstraction has 1278 states and 3213 transitions. [2021-10-05 21:11:01,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 3213 transitions. [2021-10-05 21:11:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:01,061 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:01,061 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:01,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-10-05 21:11:01,061 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:01,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1700868739, now seen corresponding path program 126 times [2021-10-05 21:11:01,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:01,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023152528] [2021-10-05 21:11:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:01,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:01,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:01,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023152528] [2021-10-05 21:11:01,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023152528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:01,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:01,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:01,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136178420] [2021-10-05 21:11:01,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:01,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:01,170 INFO L87 Difference]: Start difference. First operand 1278 states and 3213 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:01,602 INFO L93 Difference]: Finished difference Result 1842 states and 4449 transitions. [2021-10-05 21:11:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:01,605 INFO L225 Difference]: With dead ends: 1842 [2021-10-05 21:11:01,605 INFO L226 Difference]: Without dead ends: 1718 [2021-10-05 21:11:01,605 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 146.7ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-10-05 21:11:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1160. [2021-10-05 21:11:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 2.5090595340811044) internal successors, (2908), 1159 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 2908 transitions. [2021-10-05 21:11:01,623 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 2908 transitions. Word has length 38 [2021-10-05 21:11:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:01,623 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 2908 transitions. [2021-10-05 21:11:01,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 2908 transitions. [2021-10-05 21:11:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:01,625 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:01,626 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:01,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-10-05 21:11:01,626 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1888551375, now seen corresponding path program 127 times [2021-10-05 21:11:01,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:01,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605123380] [2021-10-05 21:11:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:01,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:01,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:01,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605123380] [2021-10-05 21:11:01,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605123380] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:01,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:01,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:11:01,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642786199] [2021-10-05 21:11:01,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:11:01,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:11:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:11:01,734 INFO L87 Difference]: Start difference. First operand 1160 states and 2908 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:01,935 INFO L93 Difference]: Finished difference Result 1270 states and 3138 transitions. [2021-10-05 21:11:01,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:11:01,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:01,937 INFO L225 Difference]: With dead ends: 1270 [2021-10-05 21:11:01,938 INFO L226 Difference]: Without dead ends: 1162 [2021-10-05 21:11:01,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 96.2ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-05 21:11:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2021-10-05 21:11:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1150. [2021-10-05 21:11:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 2.503046127067015) internal successors, (2876), 1149 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 2876 transitions. [2021-10-05 21:11:01,954 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 2876 transitions. Word has length 38 [2021-10-05 21:11:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:01,954 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 2876 transitions. [2021-10-05 21:11:01,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 2876 transitions. [2021-10-05 21:11:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:01,956 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:01,956 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:01,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-10-05 21:11:01,957 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 164952755, now seen corresponding path program 128 times [2021-10-05 21:11:01,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:01,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110078440] [2021-10-05 21:11:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:01,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:02,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:02,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110078440] [2021-10-05 21:11:02,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110078440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:02,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:02,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:02,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486954066] [2021-10-05 21:11:02,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:02,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:02,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:02,068 INFO L87 Difference]: Start difference. First operand 1150 states and 2876 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:02,350 INFO L93 Difference]: Finished difference Result 1266 states and 3118 transitions. [2021-10-05 21:11:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:02,352 INFO L225 Difference]: With dead ends: 1266 [2021-10-05 21:11:02,352 INFO L226 Difference]: Without dead ends: 1234 [2021-10-05 21:11:02,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 113.7ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2021-10-05 21:11:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1162. [2021-10-05 21:11:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 2.501291989664083) internal successors, (2904), 1161 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 2904 transitions. [2021-10-05 21:11:02,368 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 2904 transitions. Word has length 38 [2021-10-05 21:11:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:02,369 INFO L470 AbstractCegarLoop]: Abstraction has 1162 states and 2904 transitions. [2021-10-05 21:11:02,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 2904 transitions. [2021-10-05 21:11:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:02,370 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:02,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-10-05 21:11:02,371 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1568387079, now seen corresponding path program 129 times [2021-10-05 21:11:02,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:02,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551260289] [2021-10-05 21:11:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:02,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:02,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:02,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551260289] [2021-10-05 21:11:02,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551260289] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:02,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:02,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:02,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769322726] [2021-10-05 21:11:02,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:02,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:02,480 INFO L87 Difference]: Start difference. First operand 1162 states and 2904 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:02,735 INFO L93 Difference]: Finished difference Result 1200 states and 2969 transitions. [2021-10-05 21:11:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:02,738 INFO L225 Difference]: With dead ends: 1200 [2021-10-05 21:11:02,738 INFO L226 Difference]: Without dead ends: 1164 [2021-10-05 21:11:02,738 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 119.3ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-10-05 21:11:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1154. [2021-10-05 21:11:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 2.5030355594102343) internal successors, (2886), 1153 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2886 transitions. [2021-10-05 21:11:02,752 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2886 transitions. Word has length 38 [2021-10-05 21:11:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:02,752 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 2886 transitions. [2021-10-05 21:11:02,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2886 transitions. [2021-10-05 21:11:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:02,754 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:02,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:02,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-10-05 21:11:02,754 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:02,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1634273581, now seen corresponding path program 130 times [2021-10-05 21:11:02,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:02,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051413351] [2021-10-05 21:11:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:02,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:02,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:02,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051413351] [2021-10-05 21:11:02,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051413351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:02,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:02,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:02,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663394889] [2021-10-05 21:11:02,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:02,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:02,870 INFO L87 Difference]: Start difference. First operand 1154 states and 2886 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:03,181 INFO L93 Difference]: Finished difference Result 1376 states and 3399 transitions. [2021-10-05 21:11:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:03,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:03,184 INFO L225 Difference]: With dead ends: 1376 [2021-10-05 21:11:03,184 INFO L226 Difference]: Without dead ends: 1344 [2021-10-05 21:11:03,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 147.6ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-10-05 21:11:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1158. [2021-10-05 21:11:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 2.501296456352636) internal successors, (2894), 1157 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2894 transitions. [2021-10-05 21:11:03,199 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2894 transitions. Word has length 38 [2021-10-05 21:11:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:03,200 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 2894 transitions. [2021-10-05 21:11:03,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2894 transitions. [2021-10-05 21:11:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:03,201 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:03,201 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:03,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-10-05 21:11:03,202 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash -99066253, now seen corresponding path program 131 times [2021-10-05 21:11:03,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:03,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350721090] [2021-10-05 21:11:03,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:03,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:03,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-10-05 21:11:03,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:03,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350721090] [2021-10-05 21:11:03,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350721090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:03,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:03,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:03,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600868706] [2021-10-05 21:11:03,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:03,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:03,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:03,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:03,328 INFO L87 Difference]: Start difference. First operand 1158 states and 2894 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:03,647 INFO L93 Difference]: Finished difference Result 1198 states and 2962 transitions. [2021-10-05 21:11:03,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:03,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:03,651 INFO L225 Difference]: With dead ends: 1198 [2021-10-05 21:11:03,651 INFO L226 Difference]: Without dead ends: 1168 [2021-10-05 21:11:03,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 169.3ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2021-10-05 21:11:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1154. [2021-10-05 21:11:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 2.5013009540329576) internal successors, (2884), 1153 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 2884 transitions. [2021-10-05 21:11:03,675 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 2884 transitions. Word has length 38 [2021-10-05 21:11:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:03,675 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 2884 transitions. [2021-10-05 21:11:03,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 2884 transitions. [2021-10-05 21:11:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:03,678 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:03,679 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:03,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-10-05 21:11:03,679 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:03,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 258286701, now seen corresponding path program 132 times [2021-10-05 21:11:03,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:03,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582033231] [2021-10-05 21:11:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:03,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:03,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:03,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582033231] [2021-10-05 21:11:03,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582033231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:03,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:03,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:03,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920354003] [2021-10-05 21:11:03,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:03,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:03,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:03,786 INFO L87 Difference]: Start difference. First operand 1154 states and 2884 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:04,056 INFO L93 Difference]: Finished difference Result 1334 states and 3314 transitions. [2021-10-05 21:11:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:04,058 INFO L225 Difference]: With dead ends: 1334 [2021-10-05 21:11:04,059 INFO L226 Difference]: Without dead ends: 1302 [2021-10-05 21:11:04,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 99.2ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-10-05 21:11:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1158. [2021-10-05 21:11:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 2.499567847882455) internal successors, (2892), 1157 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 2892 transitions. [2021-10-05 21:11:04,073 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 2892 transitions. Word has length 38 [2021-10-05 21:11:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:04,073 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 2892 transitions. [2021-10-05 21:11:04,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 2892 transitions. [2021-10-05 21:11:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:04,075 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:04,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:04,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-10-05 21:11:04,075 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash 482003649, now seen corresponding path program 133 times [2021-10-05 21:11:04,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:04,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717176216] [2021-10-05 21:11:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:04,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:04,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:04,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717176216] [2021-10-05 21:11:04,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717176216] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:04,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:04,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:11:04,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016102888] [2021-10-05 21:11:04,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:11:04,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:04,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:11:04,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:11:04,172 INFO L87 Difference]: Start difference. First operand 1158 states and 2892 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:04,441 INFO L93 Difference]: Finished difference Result 1258 states and 3112 transitions. [2021-10-05 21:11:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:11:04,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:04,443 INFO L225 Difference]: With dead ends: 1258 [2021-10-05 21:11:04,444 INFO L226 Difference]: Without dead ends: 1186 [2021-10-05 21:11:04,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:11:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-10-05 21:11:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1146. [2021-10-05 21:11:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 2.496943231441048) internal successors, (2859), 1145 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2859 transitions. [2021-10-05 21:11:04,457 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2859 transitions. Word has length 38 [2021-10-05 21:11:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:04,457 INFO L470 AbstractCegarLoop]: Abstraction has 1146 states and 2859 transitions. [2021-10-05 21:11:04,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2859 transitions. [2021-10-05 21:11:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:04,459 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:04,459 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:04,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-10-05 21:11:04,459 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:04,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:04,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1948652801, now seen corresponding path program 134 times [2021-10-05 21:11:04,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:04,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206891698] [2021-10-05 21:11:04,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:04,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:04,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:04,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206891698] [2021-10-05 21:11:04,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206891698] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:04,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:04,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:11:04,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720043757] [2021-10-05 21:11:04,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:11:04,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:04,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:11:04,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:11:04,548 INFO L87 Difference]: Start difference. First operand 1146 states and 2859 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:04,794 INFO L93 Difference]: Finished difference Result 1116 states and 2758 transitions. [2021-10-05 21:11:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:11:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:04,796 INFO L225 Difference]: With dead ends: 1116 [2021-10-05 21:11:04,796 INFO L226 Difference]: Without dead ends: 1034 [2021-10-05 21:11:04,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 107.1ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:11:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2021-10-05 21:11:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1004. [2021-10-05 21:11:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 2.5074775672981056) internal successors, (2515), 1003 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 2515 transitions. [2021-10-05 21:11:04,810 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 2515 transitions. Word has length 38 [2021-10-05 21:11:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:04,810 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 2515 transitions. [2021-10-05 21:11:04,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 2515 transitions. [2021-10-05 21:11:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:04,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:04,811 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:04,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-10-05 21:11:04,812 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1172592719, now seen corresponding path program 135 times [2021-10-05 21:11:04,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:04,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689692741] [2021-10-05 21:11:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:04,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:04,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:04,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689692741] [2021-10-05 21:11:04,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689692741] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:04,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:04,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:04,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636264529] [2021-10-05 21:11:04,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:04,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:04,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:04,947 INFO L87 Difference]: Start difference. First operand 1004 states and 2515 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:05,182 INFO L93 Difference]: Finished difference Result 1030 states and 2552 transitions. [2021-10-05 21:11:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:05,186 INFO L225 Difference]: With dead ends: 1030 [2021-10-05 21:11:05,187 INFO L226 Difference]: Without dead ends: 1010 [2021-10-05 21:11:05,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 134.5ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-10-05 21:11:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1004. [2021-10-05 21:11:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 2.5014955134596213) internal successors, (2509), 1003 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 2509 transitions. [2021-10-05 21:11:05,210 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 2509 transitions. Word has length 38 [2021-10-05 21:11:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:05,210 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 2509 transitions. [2021-10-05 21:11:05,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 2509 transitions. [2021-10-05 21:11:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:05,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:05,213 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:05,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-10-05 21:11:05,214 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 630308103, now seen corresponding path program 136 times [2021-10-05 21:11:05,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:05,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234527910] [2021-10-05 21:11:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:05,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:05,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:05,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234527910] [2021-10-05 21:11:05,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234527910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:05,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:05,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:05,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174490514] [2021-10-05 21:11:05,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:05,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:05,341 INFO L87 Difference]: Start difference. First operand 1004 states and 2509 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:05,672 INFO L93 Difference]: Finished difference Result 1048 states and 2593 transitions. [2021-10-05 21:11:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:05,675 INFO L225 Difference]: With dead ends: 1048 [2021-10-05 21:11:05,675 INFO L226 Difference]: Without dead ends: 1036 [2021-10-05 21:11:05,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 142.0ms TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-10-05 21:11:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1012. [2021-10-05 21:11:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 2.4955489614243325) internal successors, (2523), 1011 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 2523 transitions. [2021-10-05 21:11:05,688 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 2523 transitions. Word has length 38 [2021-10-05 21:11:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:05,688 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 2523 transitions. [2021-10-05 21:11:05,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 2523 transitions. [2021-10-05 21:11:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:05,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:05,690 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:05,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-10-05 21:11:05,690 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1549911721, now seen corresponding path program 137 times [2021-10-05 21:11:05,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:05,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648280569] [2021-10-05 21:11:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:05,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:05,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:05,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648280569] [2021-10-05 21:11:05,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648280569] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:05,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:05,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:05,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621813351] [2021-10-05 21:11:05,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:05,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:05,816 INFO L87 Difference]: Start difference. First operand 1012 states and 2523 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:06,209 INFO L93 Difference]: Finished difference Result 1492 states and 3725 transitions. [2021-10-05 21:11:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:06,212 INFO L225 Difference]: With dead ends: 1492 [2021-10-05 21:11:06,212 INFO L226 Difference]: Without dead ends: 1484 [2021-10-05 21:11:06,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 145.7ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2021-10-05 21:11:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1014. [2021-10-05 21:11:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 2.493583415597236) internal successors, (2526), 1013 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2526 transitions. [2021-10-05 21:11:06,227 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2526 transitions. Word has length 38 [2021-10-05 21:11:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:06,227 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 2526 transitions. [2021-10-05 21:11:06,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2526 transitions. [2021-10-05 21:11:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:06,229 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:06,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:06,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-10-05 21:11:06,229 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1744343685, now seen corresponding path program 138 times [2021-10-05 21:11:06,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:06,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108898121] [2021-10-05 21:11:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:06,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:06,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:06,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108898121] [2021-10-05 21:11:06,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108898121] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:06,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:06,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:06,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835579185] [2021-10-05 21:11:06,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:06,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:06,353 INFO L87 Difference]: Start difference. First operand 1014 states and 2526 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:06,630 INFO L93 Difference]: Finished difference Result 1040 states and 2573 transitions. [2021-10-05 21:11:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:06,633 INFO L225 Difference]: With dead ends: 1040 [2021-10-05 21:11:06,634 INFO L226 Difference]: Without dead ends: 1026 [2021-10-05 21:11:06,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 146.3ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-10-05 21:11:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1006. [2021-10-05 21:11:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 2.499502487562189) internal successors, (2512), 1005 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 2512 transitions. [2021-10-05 21:11:06,654 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 2512 transitions. Word has length 38 [2021-10-05 21:11:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:06,655 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 2512 transitions. [2021-10-05 21:11:06,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 2512 transitions. [2021-10-05 21:11:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:06,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:06,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:06,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-10-05 21:11:06,658 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash 843282167, now seen corresponding path program 139 times [2021-10-05 21:11:06,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:06,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778324915] [2021-10-05 21:11:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:06,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:06,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:06,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778324915] [2021-10-05 21:11:06,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778324915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:06,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:06,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:06,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302741359] [2021-10-05 21:11:06,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:06,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:06,792 INFO L87 Difference]: Start difference. First operand 1006 states and 2512 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:07,120 INFO L93 Difference]: Finished difference Result 1040 states and 2571 transitions. [2021-10-05 21:11:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:07,123 INFO L225 Difference]: With dead ends: 1040 [2021-10-05 21:11:07,123 INFO L226 Difference]: Without dead ends: 1018 [2021-10-05 21:11:07,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 157.0ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-10-05 21:11:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 998. [2021-10-05 21:11:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 2.5015045135406218) internal successors, (2494), 997 states have internal predecessors, (2494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2494 transitions. [2021-10-05 21:11:07,138 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2494 transitions. Word has length 38 [2021-10-05 21:11:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:07,138 INFO L470 AbstractCegarLoop]: Abstraction has 998 states and 2494 transitions. [2021-10-05 21:11:07,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2494 transitions. [2021-10-05 21:11:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:07,139 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:07,140 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:07,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-10-05 21:11:07,140 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash 752003313, now seen corresponding path program 140 times [2021-10-05 21:11:07,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:07,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84324391] [2021-10-05 21:11:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:07,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:07,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:07,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84324391] [2021-10-05 21:11:07,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84324391] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:07,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:07,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:07,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605314737] [2021-10-05 21:11:07,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:07,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:07,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:07,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:07,282 INFO L87 Difference]: Start difference. First operand 998 states and 2494 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:07,573 INFO L93 Difference]: Finished difference Result 1026 states and 2538 transitions. [2021-10-05 21:11:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:07,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:07,576 INFO L225 Difference]: With dead ends: 1026 [2021-10-05 21:11:07,576 INFO L226 Difference]: Without dead ends: 998 [2021-10-05 21:11:07,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 160.4ms TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-10-05 21:11:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 992. [2021-10-05 21:11:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 2.5015136226034307) internal successors, (2479), 991 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2479 transitions. [2021-10-05 21:11:07,590 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2479 transitions. Word has length 38 [2021-10-05 21:11:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:07,590 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 2479 transitions. [2021-10-05 21:11:07,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2479 transitions. [2021-10-05 21:11:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:07,592 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:07,592 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:07,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-10-05 21:11:07,592 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1307424425, now seen corresponding path program 141 times [2021-10-05 21:11:07,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:07,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904923284] [2021-10-05 21:11:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:07,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:07,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:07,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904923284] [2021-10-05 21:11:07,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904923284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:07,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:07,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:07,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22887779] [2021-10-05 21:11:07,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:07,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:07,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:07,705 INFO L87 Difference]: Start difference. First operand 992 states and 2479 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:08,117 INFO L93 Difference]: Finished difference Result 1106 states and 2712 transitions. [2021-10-05 21:11:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:08,119 INFO L225 Difference]: With dead ends: 1106 [2021-10-05 21:11:08,119 INFO L226 Difference]: Without dead ends: 1022 [2021-10-05 21:11:08,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 150.5ms TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-10-05 21:11:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1008. [2021-10-05 21:11:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 2.479642502482622) internal successors, (2497), 1007 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2497 transitions. [2021-10-05 21:11:08,133 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2497 transitions. Word has length 38 [2021-10-05 21:11:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:08,133 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 2497 transitions. [2021-10-05 21:11:08,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2497 transitions. [2021-10-05 21:11:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:08,135 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:08,135 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:08,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-10-05 21:11:08,135 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1536914695, now seen corresponding path program 142 times [2021-10-05 21:11:08,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:08,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811068719] [2021-10-05 21:11:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:08,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:08,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:08,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811068719] [2021-10-05 21:11:08,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811068719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:08,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:08,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:08,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289948900] [2021-10-05 21:11:08,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:08,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:08,272 INFO L87 Difference]: Start difference. First operand 1008 states and 2497 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:08,592 INFO L93 Difference]: Finished difference Result 1034 states and 2540 transitions. [2021-10-05 21:11:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:08,594 INFO L225 Difference]: With dead ends: 1034 [2021-10-05 21:11:08,594 INFO L226 Difference]: Without dead ends: 1020 [2021-10-05 21:11:08,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 167.2ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2021-10-05 21:11:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1010. [2021-10-05 21:11:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 2.4777006937561943) internal successors, (2500), 1009 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2500 transitions. [2021-10-05 21:11:08,607 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2500 transitions. Word has length 38 [2021-10-05 21:11:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:08,607 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 2500 transitions. [2021-10-05 21:11:08,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2500 transitions. [2021-10-05 21:11:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:08,609 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:08,609 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:08,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-10-05 21:11:08,609 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 124690559, now seen corresponding path program 143 times [2021-10-05 21:11:08,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:08,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480106759] [2021-10-05 21:11:08,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:08,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:08,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:08,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480106759] [2021-10-05 21:11:08,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480106759] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:08,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:08,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:08,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927608546] [2021-10-05 21:11:08,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:08,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:08,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:08,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:08,744 INFO L87 Difference]: Start difference. First operand 1010 states and 2500 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:09,194 INFO L93 Difference]: Finished difference Result 1436 states and 3521 transitions. [2021-10-05 21:11:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:09,197 INFO L225 Difference]: With dead ends: 1436 [2021-10-05 21:11:09,197 INFO L226 Difference]: Without dead ends: 1344 [2021-10-05 21:11:09,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 170.4ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-10-05 21:11:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1026. [2021-10-05 21:11:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 2.4917073170731707) internal successors, (2554), 1025 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 2554 transitions. [2021-10-05 21:11:09,212 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 2554 transitions. Word has length 38 [2021-10-05 21:11:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:09,213 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 2554 transitions. [2021-10-05 21:11:09,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 2554 transitions. [2021-10-05 21:11:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:09,214 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:09,214 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:09,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-10-05 21:11:09,215 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 235249013, now seen corresponding path program 144 times [2021-10-05 21:11:09,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:09,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871262235] [2021-10-05 21:11:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:09,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:09,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:09,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871262235] [2021-10-05 21:11:09,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871262235] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:09,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:09,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:09,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454041630] [2021-10-05 21:11:09,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:09,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:09,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:09,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:09,329 INFO L87 Difference]: Start difference. First operand 1026 states and 2554 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:09,700 INFO L93 Difference]: Finished difference Result 1064 states and 2621 transitions. [2021-10-05 21:11:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:09,700 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:09,702 INFO L225 Difference]: With dead ends: 1064 [2021-10-05 21:11:09,702 INFO L226 Difference]: Without dead ends: 1034 [2021-10-05 21:11:09,703 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 147.4ms TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2021-10-05 21:11:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1018. [2021-10-05 21:11:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 2.4936086529006882) internal successors, (2536), 1017 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2536 transitions. [2021-10-05 21:11:09,716 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2536 transitions. Word has length 38 [2021-10-05 21:11:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:09,717 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2536 transitions. [2021-10-05 21:11:09,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2536 transitions. [2021-10-05 21:11:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:09,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:09,718 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:09,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-10-05 21:11:09,719 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash 391321037, now seen corresponding path program 145 times [2021-10-05 21:11:09,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:09,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954411144] [2021-10-05 21:11:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:09,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:09,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:09,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954411144] [2021-10-05 21:11:09,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954411144] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:09,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:09,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:09,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483194618] [2021-10-05 21:11:09,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:09,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:09,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:09,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:09,841 INFO L87 Difference]: Start difference. First operand 1018 states and 2536 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:10,184 INFO L93 Difference]: Finished difference Result 1122 states and 2742 transitions. [2021-10-05 21:11:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:10,187 INFO L225 Difference]: With dead ends: 1122 [2021-10-05 21:11:10,187 INFO L226 Difference]: Without dead ends: 1110 [2021-10-05 21:11:10,187 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 162.5ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-10-05 21:11:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1024. [2021-10-05 21:11:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 2.487781036168133) internal successors, (2545), 1023 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2545 transitions. [2021-10-05 21:11:10,201 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2545 transitions. Word has length 38 [2021-10-05 21:11:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:10,201 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2545 transitions. [2021-10-05 21:11:10,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2545 transitions. [2021-10-05 21:11:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:10,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:10,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:10,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-10-05 21:11:10,203 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1788898787, now seen corresponding path program 146 times [2021-10-05 21:11:10,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:10,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649590197] [2021-10-05 21:11:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:10,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:10,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:10,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649590197] [2021-10-05 21:11:10,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649590197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:10,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:10,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:10,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094775784] [2021-10-05 21:11:10,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:10,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:10,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:10,317 INFO L87 Difference]: Start difference. First operand 1024 states and 2545 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:10,677 INFO L93 Difference]: Finished difference Result 1412 states and 3445 transitions. [2021-10-05 21:11:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:10,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:10,679 INFO L225 Difference]: With dead ends: 1412 [2021-10-05 21:11:10,680 INFO L226 Difference]: Without dead ends: 1404 [2021-10-05 21:11:10,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 127.6ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2021-10-05 21:11:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1026. [2021-10-05 21:11:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 2.4858536585365854) internal successors, (2548), 1025 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 2548 transitions. [2021-10-05 21:11:10,697 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 2548 transitions. Word has length 38 [2021-10-05 21:11:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:10,697 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 2548 transitions. [2021-10-05 21:11:10,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 2548 transitions. [2021-10-05 21:11:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:10,700 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:10,700 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:10,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-10-05 21:11:10,701 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:10,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1983330751, now seen corresponding path program 147 times [2021-10-05 21:11:10,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:10,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889044782] [2021-10-05 21:11:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:10,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:10,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:10,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889044782] [2021-10-05 21:11:10,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889044782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:10,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:10,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:10,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631324376] [2021-10-05 21:11:10,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:10,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:10,815 INFO L87 Difference]: Start difference. First operand 1026 states and 2548 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:11,241 INFO L93 Difference]: Finished difference Result 1476 states and 3573 transitions. [2021-10-05 21:11:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:11,244 INFO L225 Difference]: With dead ends: 1476 [2021-10-05 21:11:11,244 INFO L226 Difference]: Without dead ends: 1462 [2021-10-05 21:11:11,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 153.1ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2021-10-05 21:11:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1018. [2021-10-05 21:11:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 2.487708947885939) internal successors, (2530), 1017 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2530 transitions. [2021-10-05 21:11:11,259 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2530 transitions. Word has length 38 [2021-10-05 21:11:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:11,259 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2530 transitions. [2021-10-05 21:11:11,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2530 transitions. [2021-10-05 21:11:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:11,261 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:11,261 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:11,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-10-05 21:11:11,261 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 230901709, now seen corresponding path program 148 times [2021-10-05 21:11:11,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:11,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49247171] [2021-10-05 21:11:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:11,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:11,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:11,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49247171] [2021-10-05 21:11:11,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49247171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:11,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:11,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:11,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118638184] [2021-10-05 21:11:11,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:11,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:11,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:11,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:11,368 INFO L87 Difference]: Start difference. First operand 1018 states and 2530 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:11,702 INFO L93 Difference]: Finished difference Result 1338 states and 3310 transitions. [2021-10-05 21:11:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:11,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:11,705 INFO L225 Difference]: With dead ends: 1338 [2021-10-05 21:11:11,705 INFO L226 Difference]: Without dead ends: 1330 [2021-10-05 21:11:11,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 138.4ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2021-10-05 21:11:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1020. [2021-10-05 21:11:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 2.4857703631010795) internal successors, (2533), 1019 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2533 transitions. [2021-10-05 21:11:11,721 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2533 transitions. Word has length 38 [2021-10-05 21:11:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:11,721 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 2533 transitions. [2021-10-05 21:11:11,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2533 transitions. [2021-10-05 21:11:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:11,722 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:11,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:11,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-10-05 21:11:11,723 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash 36469745, now seen corresponding path program 149 times [2021-10-05 21:11:11,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:11,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908548326] [2021-10-05 21:11:11,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:11,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:11,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:11,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908548326] [2021-10-05 21:11:11,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908548326] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:11,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:11,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:11,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213443721] [2021-10-05 21:11:11,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:11,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:11,846 INFO L87 Difference]: Start difference. First operand 1020 states and 2533 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:12,217 INFO L93 Difference]: Finished difference Result 1334 states and 3294 transitions. [2021-10-05 21:11:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:12,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:12,219 INFO L225 Difference]: With dead ends: 1334 [2021-10-05 21:11:12,219 INFO L226 Difference]: Without dead ends: 1326 [2021-10-05 21:11:12,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 171.7ms TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-10-05 21:11:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1018. [2021-10-05 21:11:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 2.4857423795476894) internal successors, (2528), 1017 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2528 transitions. [2021-10-05 21:11:12,234 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2528 transitions. Word has length 38 [2021-10-05 21:11:12,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:12,234 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2528 transitions. [2021-10-05 21:11:12,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2528 transitions. [2021-10-05 21:11:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:12,235 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:12,236 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:12,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-10-05 21:11:12,236 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash 159225549, now seen corresponding path program 150 times [2021-10-05 21:11:12,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:12,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894610364] [2021-10-05 21:11:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:12,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:12,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:12,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894610364] [2021-10-05 21:11:12,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894610364] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:12,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:12,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:12,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186949262] [2021-10-05 21:11:12,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:12,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:12,348 INFO L87 Difference]: Start difference. First operand 1018 states and 2528 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:12,642 INFO L93 Difference]: Finished difference Result 1368 states and 3371 transitions. [2021-10-05 21:11:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:12,645 INFO L225 Difference]: With dead ends: 1368 [2021-10-05 21:11:12,645 INFO L226 Difference]: Without dead ends: 1360 [2021-10-05 21:11:12,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 125.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2021-10-05 21:11:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1020. [2021-10-05 21:11:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 2.4838076545632974) internal successors, (2531), 1019 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2531 transitions. [2021-10-05 21:11:12,659 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2531 transitions. Word has length 38 [2021-10-05 21:11:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:12,659 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 2531 transitions. [2021-10-05 21:11:12,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2531 transitions. [2021-10-05 21:11:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:12,661 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:12,661 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:12,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-10-05 21:11:12,661 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1626398839, now seen corresponding path program 151 times [2021-10-05 21:11:12,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:12,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727597573] [2021-10-05 21:11:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:12,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:12,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:12,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727597573] [2021-10-05 21:11:12,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727597573] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:12,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:12,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:12,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602427999] [2021-10-05 21:11:12,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:12,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:12,782 INFO L87 Difference]: Start difference. First operand 1020 states and 2531 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:13,150 INFO L93 Difference]: Finished difference Result 1380 states and 3395 transitions. [2021-10-05 21:11:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:13,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:13,153 INFO L225 Difference]: With dead ends: 1380 [2021-10-05 21:11:13,153 INFO L226 Difference]: Without dead ends: 1300 [2021-10-05 21:11:13,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 146.2ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2021-10-05 21:11:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1018. [2021-10-05 21:11:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 2.4759095378564404) internal successors, (2518), 1017 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2518 transitions. [2021-10-05 21:11:13,167 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2518 transitions. Word has length 38 [2021-10-05 21:11:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:13,167 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2518 transitions. [2021-10-05 21:11:13,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2518 transitions. [2021-10-05 21:11:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:13,169 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:13,170 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:13,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-10-05 21:11:13,170 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:13,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1767630003, now seen corresponding path program 152 times [2021-10-05 21:11:13,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:13,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446698306] [2021-10-05 21:11:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:13,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:13,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:13,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446698306] [2021-10-05 21:11:13,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446698306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:13,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:13,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:13,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949670952] [2021-10-05 21:11:13,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:13,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:13,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:13,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:13,301 INFO L87 Difference]: Start difference. First operand 1018 states and 2518 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:13,748 INFO L93 Difference]: Finished difference Result 1218 states and 2942 transitions. [2021-10-05 21:11:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:13,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:13,750 INFO L225 Difference]: With dead ends: 1218 [2021-10-05 21:11:13,750 INFO L226 Difference]: Without dead ends: 1124 [2021-10-05 21:11:13,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 183.6ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-10-05 21:11:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 984. [2021-10-05 21:11:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 2.4649033570701935) internal successors, (2423), 983 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 2423 transitions. [2021-10-05 21:11:13,763 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 2423 transitions. Word has length 38 [2021-10-05 21:11:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:13,763 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 2423 transitions. [2021-10-05 21:11:13,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2423 transitions. [2021-10-05 21:11:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:13,764 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:13,764 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:13,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-10-05 21:11:13,765 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:13,765 INFO L82 PathProgramCache]: Analyzing trace with hash 896583665, now seen corresponding path program 153 times [2021-10-05 21:11:13,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:13,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981513550] [2021-10-05 21:11:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:13,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:13,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:13,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981513550] [2021-10-05 21:11:13,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981513550] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:13,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:13,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:13,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583678765] [2021-10-05 21:11:13,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:13,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:13,899 INFO L87 Difference]: Start difference. First operand 984 states and 2423 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:14,279 INFO L93 Difference]: Finished difference Result 1042 states and 2530 transitions. [2021-10-05 21:11:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:14,281 INFO L225 Difference]: With dead ends: 1042 [2021-10-05 21:11:14,281 INFO L226 Difference]: Without dead ends: 1022 [2021-10-05 21:11:14,281 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 180.1ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-10-05 21:11:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 990. [2021-10-05 21:11:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 2.4590495449949445) internal successors, (2432), 989 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 2432 transitions. [2021-10-05 21:11:14,293 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 2432 transitions. Word has length 38 [2021-10-05 21:11:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:14,294 INFO L470 AbstractCegarLoop]: Abstraction has 990 states and 2432 transitions. [2021-10-05 21:11:14,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 2432 transitions. [2021-10-05 21:11:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:14,295 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:14,295 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:14,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-10-05 21:11:14,295 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1471265555, now seen corresponding path program 154 times [2021-10-05 21:11:14,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:14,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827503867] [2021-10-05 21:11:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:14,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:14,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:14,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827503867] [2021-10-05 21:11:14,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827503867] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:14,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:14,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:14,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576130306] [2021-10-05 21:11:14,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:14,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:14,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:14,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:14,413 INFO L87 Difference]: Start difference. First operand 990 states and 2432 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:14,907 INFO L93 Difference]: Finished difference Result 1108 states and 2577 transitions. [2021-10-05 21:11:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:14,908 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:14,909 INFO L225 Difference]: With dead ends: 1108 [2021-10-05 21:11:14,909 INFO L226 Difference]: Without dead ends: 974 [2021-10-05 21:11:14,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 175.6ms TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:14,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-05 21:11:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 754. [2021-10-05 21:11:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.4276228419654715) internal successors, (1828), 753 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1828 transitions. [2021-10-05 21:11:14,920 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1828 transitions. Word has length 38 [2021-10-05 21:11:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:14,920 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1828 transitions. [2021-10-05 21:11:14,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1828 transitions. [2021-10-05 21:11:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:14,921 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:14,921 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:14,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-10-05 21:11:14,921 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1513621633, now seen corresponding path program 155 times [2021-10-05 21:11:14,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:14,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111041800] [2021-10-05 21:11:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:14,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:15,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:15,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111041800] [2021-10-05 21:11:15,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111041800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:15,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:15,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:15,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270796832] [2021-10-05 21:11:15,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:15,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:15,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:15,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:15,032 INFO L87 Difference]: Start difference. First operand 754 states and 1828 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:15,311 INFO L93 Difference]: Finished difference Result 768 states and 1847 transitions. [2021-10-05 21:11:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:15,313 INFO L225 Difference]: With dead ends: 768 [2021-10-05 21:11:15,313 INFO L226 Difference]: Without dead ends: 756 [2021-10-05 21:11:15,314 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 141.7ms TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-10-05 21:11:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 754. [2021-10-05 21:11:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.4196547144754317) internal successors, (1822), 753 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1822 transitions. [2021-10-05 21:11:15,323 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1822 transitions. Word has length 38 [2021-10-05 21:11:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:15,323 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1822 transitions. [2021-10-05 21:11:15,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1822 transitions. [2021-10-05 21:11:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:15,324 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:15,324 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:15,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-10-05 21:11:15,324 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -666598191, now seen corresponding path program 156 times [2021-10-05 21:11:15,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:15,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596301410] [2021-10-05 21:11:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:15,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:15,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:15,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596301410] [2021-10-05 21:11:15,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596301410] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:15,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:15,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:15,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118479194] [2021-10-05 21:11:15,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:15,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:15,440 INFO L87 Difference]: Start difference. First operand 754 states and 1822 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:15,823 INFO L93 Difference]: Finished difference Result 962 states and 2282 transitions. [2021-10-05 21:11:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:15,826 INFO L225 Difference]: With dead ends: 962 [2021-10-05 21:11:15,826 INFO L226 Difference]: Without dead ends: 954 [2021-10-05 21:11:15,826 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 146.9ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-10-05 21:11:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 754. [2021-10-05 21:11:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 2.4169986719787517) internal successors, (1820), 753 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1820 transitions. [2021-10-05 21:11:15,836 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1820 transitions. Word has length 38 [2021-10-05 21:11:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:15,836 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1820 transitions. [2021-10-05 21:11:15,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1820 transitions. [2021-10-05 21:11:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:15,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:15,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:15,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-10-05 21:11:15,838 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -861030155, now seen corresponding path program 157 times [2021-10-05 21:11:15,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:15,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800582127] [2021-10-05 21:11:15,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:15,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:15,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:15,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800582127] [2021-10-05 21:11:15,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800582127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:15,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:15,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:15,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119467274] [2021-10-05 21:11:15,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:15,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:15,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:15,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:15,954 INFO L87 Difference]: Start difference. First operand 754 states and 1820 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:16,249 INFO L93 Difference]: Finished difference Result 760 states and 1827 transitions. [2021-10-05 21:11:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:16,251 INFO L225 Difference]: With dead ends: 760 [2021-10-05 21:11:16,251 INFO L226 Difference]: Without dead ends: 746 [2021-10-05 21:11:16,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-10-05 21:11:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2021-10-05 21:11:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 2.4241610738255033) internal successors, (1806), 745 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1806 transitions. [2021-10-05 21:11:16,260 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1806 transitions. Word has length 38 [2021-10-05 21:11:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:16,260 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1806 transitions. [2021-10-05 21:11:16,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1806 transitions. [2021-10-05 21:11:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:16,262 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:16,262 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:16,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-10-05 21:11:16,262 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1726595697, now seen corresponding path program 158 times [2021-10-05 21:11:16,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:16,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119782276] [2021-10-05 21:11:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:16,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:16,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:16,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119782276] [2021-10-05 21:11:16,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119782276] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:16,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:16,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:16,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288736337] [2021-10-05 21:11:16,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:16,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:16,380 INFO L87 Difference]: Start difference. First operand 746 states and 1806 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:16,666 INFO L93 Difference]: Finished difference Result 760 states and 1825 transitions. [2021-10-05 21:11:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:16,668 INFO L225 Difference]: With dead ends: 760 [2021-10-05 21:11:16,668 INFO L226 Difference]: Without dead ends: 744 [2021-10-05 21:11:16,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 164.9ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-05 21:11:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2021-10-05 21:11:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.423956931359354) internal successors, (1801), 743 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1801 transitions. [2021-10-05 21:11:16,678 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1801 transitions. Word has length 38 [2021-10-05 21:11:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:16,678 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 1801 transitions. [2021-10-05 21:11:16,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1801 transitions. [2021-10-05 21:11:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:16,679 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:16,680 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:16,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-10-05 21:11:16,680 INFO L402 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash -311268095, now seen corresponding path program 159 times [2021-10-05 21:11:16,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:16,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155398470] [2021-10-05 21:11:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:16,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:16,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:16,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155398470] [2021-10-05 21:11:16,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155398470] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:16,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:16,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:16,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562169246] [2021-10-05 21:11:16,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:16,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:16,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:16,821 INFO L87 Difference]: Start difference. First operand 744 states and 1801 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:17,136 INFO L93 Difference]: Finished difference Result 766 states and 1836 transitions. [2021-10-05 21:11:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:17,138 INFO L225 Difference]: With dead ends: 766 [2021-10-05 21:11:17,138 INFO L226 Difference]: Without dead ends: 746 [2021-10-05 21:11:17,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 179.6ms TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-10-05 21:11:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2021-10-05 21:11:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.4158815612382236) internal successors, (1795), 743 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1795 transitions. [2021-10-05 21:11:17,148 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1795 transitions. Word has length 38 [2021-10-05 21:11:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:17,148 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 1795 transitions. [2021-10-05 21:11:17,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1795 transitions. [2021-10-05 21:11:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:17,149 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:17,149 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:17,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-10-05 21:11:17,150 INFO L402 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1139360081, now seen corresponding path program 160 times [2021-10-05 21:11:17,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:17,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710978990] [2021-10-05 21:11:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:17,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:17,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:17,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710978990] [2021-10-05 21:11:17,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710978990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:17,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:17,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:17,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238413113] [2021-10-05 21:11:17,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:17,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:17,284 INFO L87 Difference]: Start difference. First operand 744 states and 1795 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:17,557 INFO L93 Difference]: Finished difference Result 758 states and 1818 transitions. [2021-10-05 21:11:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:17,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:17,559 INFO L225 Difference]: With dead ends: 758 [2021-10-05 21:11:17,559 INFO L226 Difference]: Without dead ends: 744 [2021-10-05 21:11:17,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 171.2ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-10-05 21:11:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2021-10-05 21:11:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.4131897711978465) internal successors, (1793), 743 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1793 transitions. [2021-10-05 21:11:17,568 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1793 transitions. Word has length 38 [2021-10-05 21:11:17,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:17,568 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 1793 transitions. [2021-10-05 21:11:17,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1793 transitions. [2021-10-05 21:11:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:17,569 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:17,569 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:17,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-10-05 21:11:17,570 INFO L402 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:17,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1494001961, now seen corresponding path program 161 times [2021-10-05 21:11:17,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:17,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310774716] [2021-10-05 21:11:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:17,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:17,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:17,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310774716] [2021-10-05 21:11:17,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310774716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:17,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:17,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:17,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167029034] [2021-10-05 21:11:17,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:17,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:17,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:17,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:17,698 INFO L87 Difference]: Start difference. First operand 744 states and 1793 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:18,114 INFO L93 Difference]: Finished difference Result 922 states and 2194 transitions. [2021-10-05 21:11:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:18,116 INFO L225 Difference]: With dead ends: 922 [2021-10-05 21:11:18,116 INFO L226 Difference]: Without dead ends: 896 [2021-10-05 21:11:18,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 170.6ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-10-05 21:11:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 736. [2021-10-05 21:11:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.4204081632653063) internal successors, (1779), 735 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1779 transitions. [2021-10-05 21:11:18,126 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1779 transitions. Word has length 38 [2021-10-05 21:11:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:18,126 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1779 transitions. [2021-10-05 21:11:18,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1779 transitions. [2021-10-05 21:11:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:18,127 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:18,127 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:18,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-10-05 21:11:18,127 INFO L402 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:18,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1383443507, now seen corresponding path program 162 times [2021-10-05 21:11:18,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:18,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407629970] [2021-10-05 21:11:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:18,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:18,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:18,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407629970] [2021-10-05 21:11:18,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407629970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:18,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:18,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:18,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399913838] [2021-10-05 21:11:18,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:18,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:18,247 INFO L87 Difference]: Start difference. First operand 736 states and 1779 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:18,529 INFO L93 Difference]: Finished difference Result 748 states and 1799 transitions. [2021-10-05 21:11:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:18,530 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:18,531 INFO L225 Difference]: With dead ends: 748 [2021-10-05 21:11:18,531 INFO L226 Difference]: Without dead ends: 716 [2021-10-05 21:11:18,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 161.9ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-05 21:11:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-10-05 21:11:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 2.4377622377622377) internal successors, (1743), 715 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1743 transitions. [2021-10-05 21:11:18,540 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1743 transitions. Word has length 38 [2021-10-05 21:11:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:18,540 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 1743 transitions. [2021-10-05 21:11:18,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1743 transitions. [2021-10-05 21:11:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:18,541 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:18,541 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:18,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-10-05 21:11:18,541 INFO L402 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1304373613, now seen corresponding path program 163 times [2021-10-05 21:11:18,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:18,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395300138] [2021-10-05 21:11:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:18,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:18,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:18,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395300138] [2021-10-05 21:11:18,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395300138] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:18,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:18,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:18,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804774207] [2021-10-05 21:11:18,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:18,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:18,660 INFO L87 Difference]: Start difference. First operand 716 states and 1743 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:19,135 INFO L93 Difference]: Finished difference Result 1220 states and 3020 transitions. [2021-10-05 21:11:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:19,138 INFO L225 Difference]: With dead ends: 1220 [2021-10-05 21:11:19,138 INFO L226 Difference]: Without dead ends: 1208 [2021-10-05 21:11:19,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 214.3ms TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-10-05 21:11:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 742. [2021-10-05 21:11:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.4507422402159245) internal successors, (1816), 741 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1816 transitions. [2021-10-05 21:11:19,150 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1816 transitions. Word has length 38 [2021-10-05 21:11:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:19,150 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1816 transitions. [2021-10-05 21:11:19,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1816 transitions. [2021-10-05 21:11:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:19,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:19,152 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:19,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-10-05 21:11:19,152 INFO L402 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash 378487811, now seen corresponding path program 164 times [2021-10-05 21:11:19,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:19,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872697613] [2021-10-05 21:11:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:19,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:19,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:19,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872697613] [2021-10-05 21:11:19,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872697613] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:19,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:19,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:11:19,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982726569] [2021-10-05 21:11:19,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:11:19,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:11:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:11:19,245 INFO L87 Difference]: Start difference. First operand 742 states and 1816 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:19,507 INFO L93 Difference]: Finished difference Result 1022 states and 2511 transitions. [2021-10-05 21:11:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:19,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:19,509 INFO L225 Difference]: With dead ends: 1022 [2021-10-05 21:11:19,509 INFO L226 Difference]: Without dead ends: 936 [2021-10-05 21:11:19,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 126.5ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-10-05 21:11:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 748. [2021-10-05 21:11:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 2.424364123159304) internal successors, (1811), 747 states have internal predecessors, (1811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1811 transitions. [2021-10-05 21:11:19,519 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1811 transitions. Word has length 38 [2021-10-05 21:11:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:19,519 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1811 transitions. [2021-10-05 21:11:19,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1811 transitions. [2021-10-05 21:11:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:19,521 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:19,521 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:19,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-10-05 21:11:19,521 INFO L402 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash 810373859, now seen corresponding path program 165 times [2021-10-05 21:11:19,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:19,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159567750] [2021-10-05 21:11:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:19,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:19,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:19,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159567750] [2021-10-05 21:11:19,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159567750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:19,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:19,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:19,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080264187] [2021-10-05 21:11:19,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:19,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:19,627 INFO L87 Difference]: Start difference. First operand 748 states and 1811 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:20,016 INFO L93 Difference]: Finished difference Result 1270 states and 3034 transitions. [2021-10-05 21:11:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:20,017 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:20,019 INFO L225 Difference]: With dead ends: 1270 [2021-10-05 21:11:20,019 INFO L226 Difference]: Without dead ends: 1262 [2021-10-05 21:11:20,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 188.4ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2021-10-05 21:11:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 750. [2021-10-05 21:11:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.4218958611481978) internal successors, (1814), 749 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1814 transitions. [2021-10-05 21:11:20,032 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1814 transitions. Word has length 38 [2021-10-05 21:11:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:20,032 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1814 transitions. [2021-10-05 21:11:20,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1814 transitions. [2021-10-05 21:11:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:20,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:20,033 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:20,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-10-05 21:11:20,034 INFO L402 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash 615941895, now seen corresponding path program 166 times [2021-10-05 21:11:20,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:20,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444765117] [2021-10-05 21:11:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:20,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:20,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:20,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444765117] [2021-10-05 21:11:20,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444765117] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:20,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:20,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:20,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581859047] [2021-10-05 21:11:20,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:20,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:20,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:20,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:20,146 INFO L87 Difference]: Start difference. First operand 750 states and 1814 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:20,616 INFO L93 Difference]: Finished difference Result 1308 states and 3107 transitions. [2021-10-05 21:11:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:11:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:20,623 INFO L225 Difference]: With dead ends: 1308 [2021-10-05 21:11:20,623 INFO L226 Difference]: Without dead ends: 1294 [2021-10-05 21:11:20,623 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 243.2ms TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:11:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2021-10-05 21:11:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 742. [2021-10-05 21:11:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.4237516869095814) internal successors, (1796), 741 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1796 transitions. [2021-10-05 21:11:20,634 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1796 transitions. Word has length 38 [2021-10-05 21:11:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:20,634 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1796 transitions. [2021-10-05 21:11:20,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1796 transitions. [2021-10-05 21:11:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:20,635 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:20,635 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:20,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-10-05 21:11:20,636 INFO L402 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1464792941, now seen corresponding path program 167 times [2021-10-05 21:11:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:20,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883333135] [2021-10-05 21:11:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:20,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:20,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:20,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883333135] [2021-10-05 21:11:20,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883333135] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:20,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:20,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:20,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403526248] [2021-10-05 21:11:20,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:20,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:20,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:20,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:20,742 INFO L87 Difference]: Start difference. First operand 742 states and 1796 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:21,141 INFO L93 Difference]: Finished difference Result 1154 states and 2784 transitions. [2021-10-05 21:11:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:21,148 INFO L225 Difference]: With dead ends: 1154 [2021-10-05 21:11:21,148 INFO L226 Difference]: Without dead ends: 1146 [2021-10-05 21:11:21,148 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 195.0ms TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:11:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-05 21:11:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 742. [2021-10-05 21:11:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.4210526315789473) internal successors, (1794), 741 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1794 transitions. [2021-10-05 21:11:21,163 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1794 transitions. Word has length 38 [2021-10-05 21:11:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:21,164 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1794 transitions. [2021-10-05 21:11:21,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1794 transitions. [2021-10-05 21:11:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:21,165 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:21,165 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:21,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2021-10-05 21:11:21,166 INFO L402 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1659224905, now seen corresponding path program 168 times [2021-10-05 21:11:21,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:21,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411464461] [2021-10-05 21:11:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:21,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:21,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:21,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411464461] [2021-10-05 21:11:21,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411464461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:21,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:21,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:21,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343035151] [2021-10-05 21:11:21,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:21,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:21,269 INFO L87 Difference]: Start difference. First operand 742 states and 1794 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:21,741 INFO L93 Difference]: Finished difference Result 1160 states and 2793 transitions. [2021-10-05 21:11:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:11:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:21,743 INFO L225 Difference]: With dead ends: 1160 [2021-10-05 21:11:21,743 INFO L226 Difference]: Without dead ends: 1152 [2021-10-05 21:11:21,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 224.5ms TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:11:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-10-05 21:11:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 740. [2021-10-05 21:11:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.4208389715832204) internal successors, (1789), 739 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1789 transitions. [2021-10-05 21:11:21,754 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1789 transitions. Word has length 38 [2021-10-05 21:11:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:21,754 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 1789 transitions. [2021-10-05 21:11:21,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1789 transitions. [2021-10-05 21:11:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:21,755 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:21,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:21,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-10-05 21:11:21,755 INFO L402 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1536469101, now seen corresponding path program 169 times [2021-10-05 21:11:21,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:21,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948637398] [2021-10-05 21:11:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:21,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:21,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:21,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948637398] [2021-10-05 21:11:21,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948637398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:21,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:21,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:21,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102327661] [2021-10-05 21:11:21,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:21,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:21,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:21,854 INFO L87 Difference]: Start difference. First operand 740 states and 1789 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:22,209 INFO L93 Difference]: Finished difference Result 974 states and 2300 transitions. [2021-10-05 21:11:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:22,211 INFO L225 Difference]: With dead ends: 974 [2021-10-05 21:11:22,211 INFO L226 Difference]: Without dead ends: 966 [2021-10-05 21:11:22,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 148.9ms TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-10-05 21:11:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 742. [2021-10-05 21:11:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 2.4183535762483133) internal successors, (1792), 741 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1792 transitions. [2021-10-05 21:11:22,221 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1792 transitions. Word has length 38 [2021-10-05 21:11:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:22,221 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1792 transitions. [2021-10-05 21:11:22,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1792 transitions. [2021-10-05 21:11:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:22,223 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:22,223 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:22,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2021-10-05 21:11:22,223 INFO L402 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash -69295811, now seen corresponding path program 170 times [2021-10-05 21:11:22,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:22,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658845664] [2021-10-05 21:11:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:22,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:22,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-10-05 21:11:22,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:22,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658845664] [2021-10-05 21:11:22,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658845664] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:22,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:22,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:22,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850080088] [2021-10-05 21:11:22,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:22,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:22,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:22,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:22,329 INFO L87 Difference]: Start difference. First operand 742 states and 1792 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:22,733 INFO L93 Difference]: Finished difference Result 980 states and 2317 transitions. [2021-10-05 21:11:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:11:22,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:22,735 INFO L225 Difference]: With dead ends: 980 [2021-10-05 21:11:22,736 INFO L226 Difference]: Without dead ends: 876 [2021-10-05 21:11:22,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 190.1ms TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:11:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-10-05 21:11:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 722. [2021-10-05 21:11:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 2.4036061026352287) internal successors, (1733), 721 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1733 transitions. [2021-10-05 21:11:22,745 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1733 transitions. Word has length 38 [2021-10-05 21:11:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:22,745 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1733 transitions. [2021-10-05 21:11:22,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1733 transitions. [2021-10-05 21:11:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:22,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:22,746 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:22,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-10-05 21:11:22,747 INFO L402 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:22,747 INFO L82 PathProgramCache]: Analyzing trace with hash 831642643, now seen corresponding path program 171 times [2021-10-05 21:11:22,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:22,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426697125] [2021-10-05 21:11:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:22,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:22,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:22,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426697125] [2021-10-05 21:11:22,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426697125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:22,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:22,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:22,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116516186] [2021-10-05 21:11:22,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:22,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:22,878 INFO L87 Difference]: Start difference. First operand 722 states and 1733 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:23,374 INFO L93 Difference]: Finished difference Result 922 states and 2177 transitions. [2021-10-05 21:11:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:11:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:23,376 INFO L225 Difference]: With dead ends: 922 [2021-10-05 21:11:23,376 INFO L226 Difference]: Without dead ends: 898 [2021-10-05 21:11:23,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 278.1ms TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-10-05 21:11:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-10-05 21:11:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 720. [2021-10-05 21:11:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.403337969401947) internal successors, (1728), 719 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1728 transitions. [2021-10-05 21:11:23,386 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1728 transitions. Word has length 38 [2021-10-05 21:11:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:23,387 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1728 transitions. [2021-10-05 21:11:23,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1728 transitions. [2021-10-05 21:11:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:23,388 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:23,388 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:23,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-10-05 21:11:23,388 INFO L402 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:23,388 INFO L82 PathProgramCache]: Analyzing trace with hash -799110985, now seen corresponding path program 172 times [2021-10-05 21:11:23,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:23,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273206923] [2021-10-05 21:11:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:23,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:23,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:23,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273206923] [2021-10-05 21:11:23,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273206923] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:23,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:23,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:23,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207704089] [2021-10-05 21:11:23,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:23,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:23,512 INFO L87 Difference]: Start difference. First operand 720 states and 1728 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:24,062 INFO L93 Difference]: Finished difference Result 704 states and 1561 transitions. [2021-10-05 21:11:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:11:24,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:24,064 INFO L225 Difference]: With dead ends: 704 [2021-10-05 21:11:24,064 INFO L226 Difference]: Without dead ends: 592 [2021-10-05 21:11:24,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 281.5ms TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2021-10-05 21:11:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-10-05 21:11:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 464. [2021-10-05 21:11:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.287257019438445) internal successors, (1059), 463 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1059 transitions. [2021-10-05 21:11:24,071 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1059 transitions. Word has length 38 [2021-10-05 21:11:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:24,071 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1059 transitions. [2021-10-05 21:11:24,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1059 transitions. [2021-10-05 21:11:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:24,072 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:24,072 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:24,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2021-10-05 21:11:24,072 INFO L402 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1128007091, now seen corresponding path program 173 times [2021-10-05 21:11:24,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:24,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740125062] [2021-10-05 21:11:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:24,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:24,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:24,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740125062] [2021-10-05 21:11:24,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740125062] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:24,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:24,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:24,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669904982] [2021-10-05 21:11:24,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:24,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:24,196 INFO L87 Difference]: Start difference. First operand 464 states and 1059 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:24,760 INFO L93 Difference]: Finished difference Result 786 states and 1746 transitions. [2021-10-05 21:11:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:11:24,761 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:24,762 INFO L225 Difference]: With dead ends: 786 [2021-10-05 21:11:24,762 INFO L226 Difference]: Without dead ends: 740 [2021-10-05 21:11:24,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 290.4ms TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2021-10-05 21:11:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-05 21:11:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 452. [2021-10-05 21:11:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 2.29490022172949) internal successors, (1035), 451 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1035 transitions. [2021-10-05 21:11:24,769 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1035 transitions. Word has length 38 [2021-10-05 21:11:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:24,769 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1035 transitions. [2021-10-05 21:11:24,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1035 transitions. [2021-10-05 21:11:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:24,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:24,770 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:24,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-10-05 21:11:24,771 INFO L402 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash -182073017, now seen corresponding path program 174 times [2021-10-05 21:11:24,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:24,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965786094] [2021-10-05 21:11:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:24,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:24,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:24,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965786094] [2021-10-05 21:11:24,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965786094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:24,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:24,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:24,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013863945] [2021-10-05 21:11:24,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:24,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:24,889 INFO L87 Difference]: Start difference. First operand 452 states and 1035 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:25,267 INFO L93 Difference]: Finished difference Result 570 states and 1266 transitions. [2021-10-05 21:11:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:25,268 INFO L225 Difference]: With dead ends: 570 [2021-10-05 21:11:25,268 INFO L226 Difference]: Without dead ends: 558 [2021-10-05 21:11:25,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 211.0ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-05 21:11:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 458. [2021-10-05 21:11:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.2844638949671774) internal successors, (1044), 457 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1044 transitions. [2021-10-05 21:11:25,274 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1044 transitions. Word has length 38 [2021-10-05 21:11:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:25,274 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1044 transitions. [2021-10-05 21:11:25,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1044 transitions. [2021-10-05 21:11:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:25,275 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:25,275 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:25,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-10-05 21:11:25,276 INFO L402 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1932674455, now seen corresponding path program 175 times [2021-10-05 21:11:25,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:25,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701166333] [2021-10-05 21:11:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:25,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:25,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:25,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701166333] [2021-10-05 21:11:25,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701166333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:25,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:25,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:25,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184412928] [2021-10-05 21:11:25,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:25,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:25,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:25,399 INFO L87 Difference]: Start difference. First operand 458 states and 1044 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:25,814 INFO L93 Difference]: Finished difference Result 740 states and 1657 transitions. [2021-10-05 21:11:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:25,816 INFO L225 Difference]: With dead ends: 740 [2021-10-05 21:11:25,816 INFO L226 Difference]: Without dead ends: 732 [2021-10-05 21:11:25,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 225.3ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-10-05 21:11:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 460. [2021-10-05 21:11:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.281045751633987) internal successors, (1047), 459 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1047 transitions. [2021-10-05 21:11:25,823 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1047 transitions. Word has length 38 [2021-10-05 21:11:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:25,824 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1047 transitions. [2021-10-05 21:11:25,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1047 transitions. [2021-10-05 21:11:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:25,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:25,824 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:25,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-10-05 21:11:25,825 INFO L402 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:25,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:25,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1738242491, now seen corresponding path program 176 times [2021-10-05 21:11:25,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:25,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578552270] [2021-10-05 21:11:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:25,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:25,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:25,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578552270] [2021-10-05 21:11:25,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578552270] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:25,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:25,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:25,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455122517] [2021-10-05 21:11:25,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:25,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:25,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:25,949 INFO L87 Difference]: Start difference. First operand 460 states and 1047 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:26,408 INFO L93 Difference]: Finished difference Result 578 states and 1286 transitions. [2021-10-05 21:11:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:26,409 INFO L225 Difference]: With dead ends: 578 [2021-10-05 21:11:26,410 INFO L226 Difference]: Without dead ends: 564 [2021-10-05 21:11:26,410 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 263.9ms TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:11:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2021-10-05 21:11:26,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 452. [2021-10-05 21:11:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 2.2904656319290466) internal successors, (1033), 451 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1033 transitions. [2021-10-05 21:11:26,417 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1033 transitions. Word has length 38 [2021-10-05 21:11:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:26,417 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1033 transitions. [2021-10-05 21:11:26,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1033 transitions. [2021-10-05 21:11:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:26,418 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:26,418 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:26,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-10-05 21:11:26,418 INFO L402 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:26,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:26,419 INFO L82 PathProgramCache]: Analyzing trace with hash 30901047, now seen corresponding path program 177 times [2021-10-05 21:11:26,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:26,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175682194] [2021-10-05 21:11:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:26,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:26,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:26,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175682194] [2021-10-05 21:11:26,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175682194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:26,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:26,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:26,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67248526] [2021-10-05 21:11:26,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:26,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:26,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:26,537 INFO L87 Difference]: Start difference. First operand 452 states and 1033 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:26,828 INFO L93 Difference]: Finished difference Result 516 states and 1147 transitions. [2021-10-05 21:11:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:26,829 INFO L225 Difference]: With dead ends: 516 [2021-10-05 21:11:26,829 INFO L226 Difference]: Without dead ends: 500 [2021-10-05 21:11:26,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 170.3ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-10-05 21:11:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 450. [2021-10-05 21:11:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 2.289532293986637) internal successors, (1028), 449 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1028 transitions. [2021-10-05 21:11:26,835 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1028 transitions. Word has length 38 [2021-10-05 21:11:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:26,836 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 1028 transitions. [2021-10-05 21:11:26,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1028 transitions. [2021-10-05 21:11:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:26,836 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:26,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:26,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-10-05 21:11:26,837 INFO L402 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2006962745, now seen corresponding path program 178 times [2021-10-05 21:11:26,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:26,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115337183] [2021-10-05 21:11:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:26,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:26,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:26,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115337183] [2021-10-05 21:11:26,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115337183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:26,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:26,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:26,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25868960] [2021-10-05 21:11:26,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:26,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:26,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:26,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:26,962 INFO L87 Difference]: Start difference. First operand 450 states and 1028 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:27,428 INFO L93 Difference]: Finished difference Result 540 states and 1203 transitions. [2021-10-05 21:11:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:11:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:27,430 INFO L225 Difference]: With dead ends: 540 [2021-10-05 21:11:27,430 INFO L226 Difference]: Without dead ends: 520 [2021-10-05 21:11:27,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 290.9ms TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:11:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-05 21:11:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 456. [2021-10-05 21:11:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.279120879120879) internal successors, (1037), 455 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1037 transitions. [2021-10-05 21:11:27,436 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1037 transitions. Word has length 38 [2021-10-05 21:11:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:27,436 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1037 transitions. [2021-10-05 21:11:27,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1037 transitions. [2021-10-05 21:11:27,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:27,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:27,437 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:27,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-10-05 21:11:27,437 INFO L402 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:27,438 INFO L82 PathProgramCache]: Analyzing trace with hash -556334569, now seen corresponding path program 179 times [2021-10-05 21:11:27,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:27,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338157277] [2021-10-05 21:11:27,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:27,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:27,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:27,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338157277] [2021-10-05 21:11:27,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338157277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:27,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:27,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:27,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523588460] [2021-10-05 21:11:27,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:27,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:27,571 INFO L87 Difference]: Start difference. First operand 456 states and 1037 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:28,073 INFO L93 Difference]: Finished difference Result 548 states and 1225 transitions. [2021-10-05 21:11:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:11:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:28,074 INFO L225 Difference]: With dead ends: 548 [2021-10-05 21:11:28,074 INFO L226 Difference]: Without dead ends: 534 [2021-10-05 21:11:28,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 282.3ms TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:11:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-10-05 21:11:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 458. [2021-10-05 21:11:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.2757111597374178) internal successors, (1040), 457 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1040 transitions. [2021-10-05 21:11:28,080 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1040 transitions. Word has length 38 [2021-10-05 21:11:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:28,081 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1040 transitions. [2021-10-05 21:11:28,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1040 transitions. [2021-10-05 21:11:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:28,081 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:28,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-10-05 21:11:28,082 INFO L402 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1105270685, now seen corresponding path program 180 times [2021-10-05 21:11:28,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:28,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503197125] [2021-10-05 21:11:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:28,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:28,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:28,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503197125] [2021-10-05 21:11:28,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503197125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:28,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:28,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:28,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841788331] [2021-10-05 21:11:28,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:28,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:28,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:28,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:28,211 INFO L87 Difference]: Start difference. First operand 458 states and 1040 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:28,679 INFO L93 Difference]: Finished difference Result 676 states and 1521 transitions. [2021-10-05 21:11:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:28,681 INFO L225 Difference]: With dead ends: 676 [2021-10-05 21:11:28,681 INFO L226 Difference]: Without dead ends: 650 [2021-10-05 21:11:28,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 254.8ms TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:11:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-10-05 21:11:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 450. [2021-10-05 21:11:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 2.285077951002227) internal successors, (1026), 449 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1026 transitions. [2021-10-05 21:11:28,688 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1026 transitions. Word has length 38 [2021-10-05 21:11:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:28,688 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 1026 transitions. [2021-10-05 21:11:28,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1026 transitions. [2021-10-05 21:11:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:28,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:28,689 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:28,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-10-05 21:11:28,689 INFO L402 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1215829139, now seen corresponding path program 181 times [2021-10-05 21:11:28,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:28,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701014922] [2021-10-05 21:11:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:28,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:28,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:28,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701014922] [2021-10-05 21:11:28,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701014922] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:28,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:28,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:28,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925412354] [2021-10-05 21:11:28,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:28,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:28,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:28,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:28,821 INFO L87 Difference]: Start difference. First operand 450 states and 1026 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:29,163 INFO L93 Difference]: Finished difference Result 470 states and 1058 transitions. [2021-10-05 21:11:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:29,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:29,164 INFO L225 Difference]: With dead ends: 470 [2021-10-05 21:11:29,165 INFO L226 Difference]: Without dead ends: 444 [2021-10-05 21:11:29,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 218.7ms TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-10-05 21:11:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2021-10-05 21:11:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 2.291196388261851) internal successors, (1015), 443 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1015 transitions. [2021-10-05 21:11:29,170 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1015 transitions. Word has length 38 [2021-10-05 21:11:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:29,171 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1015 transitions. [2021-10-05 21:11:29,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1015 transitions. [2021-10-05 21:11:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:29,171 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:29,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:29,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-10-05 21:11:29,172 INFO L402 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:29,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1010293933, now seen corresponding path program 182 times [2021-10-05 21:11:29,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:29,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467988099] [2021-10-05 21:11:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:29,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:29,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:29,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467988099] [2021-10-05 21:11:29,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467988099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:29,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:29,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:29,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939401919] [2021-10-05 21:11:29,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:29,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:29,262 INFO L87 Difference]: Start difference. First operand 444 states and 1015 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:29,618 INFO L93 Difference]: Finished difference Result 538 states and 1194 transitions. [2021-10-05 21:11:29,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:29,619 INFO L225 Difference]: With dead ends: 538 [2021-10-05 21:11:29,620 INFO L226 Difference]: Without dead ends: 526 [2021-10-05 21:11:29,620 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 168.8ms TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-05 21:11:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 444. [2021-10-05 21:11:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 2.2776523702031604) internal successors, (1009), 443 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1009 transitions. [2021-10-05 21:11:29,626 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1009 transitions. Word has length 38 [2021-10-05 21:11:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:29,626 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1009 transitions. [2021-10-05 21:11:29,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1009 transitions. [2021-10-05 21:11:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:29,627 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:29,627 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:29,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-10-05 21:11:29,628 INFO L402 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1104453539, now seen corresponding path program 183 times [2021-10-05 21:11:29,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:29,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431355432] [2021-10-05 21:11:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:29,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:29,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:29,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431355432] [2021-10-05 21:11:29,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431355432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:29,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:29,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:11:29,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422901040] [2021-10-05 21:11:29,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:11:29,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:11:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:11:29,708 INFO L87 Difference]: Start difference. First operand 444 states and 1009 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:30,080 INFO L93 Difference]: Finished difference Result 696 states and 1559 transitions. [2021-10-05 21:11:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:30,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:30,082 INFO L225 Difference]: With dead ends: 696 [2021-10-05 21:11:30,082 INFO L226 Difference]: Without dead ends: 688 [2021-10-05 21:11:30,083 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 157.8ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-05 21:11:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 446. [2021-10-05 21:11:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.2741573033707865) internal successors, (1012), 445 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1012 transitions. [2021-10-05 21:11:30,089 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1012 transitions. Word has length 38 [2021-10-05 21:11:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:30,089 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1012 transitions. [2021-10-05 21:11:30,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1012 transitions. [2021-10-05 21:11:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:30,090 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:30,090 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:30,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-10-05 21:11:30,090 INFO L402 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 910021575, now seen corresponding path program 184 times [2021-10-05 21:11:30,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:30,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19642102] [2021-10-05 21:11:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:30,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:30,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:30,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19642102] [2021-10-05 21:11:30,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19642102] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:30,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:30,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:30,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656470259] [2021-10-05 21:11:30,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:30,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:30,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:30,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:30,176 INFO L87 Difference]: Start difference. First operand 446 states and 1012 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:30,639 INFO L93 Difference]: Finished difference Result 734 states and 1632 transitions. [2021-10-05 21:11:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:11:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:30,642 INFO L225 Difference]: With dead ends: 734 [2021-10-05 21:11:30,642 INFO L226 Difference]: Without dead ends: 720 [2021-10-05 21:11:30,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 215.2ms TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:11:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2021-10-05 21:11:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 438. [2021-10-05 21:11:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.274599542334096) internal successors, (994), 437 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 994 transitions. [2021-10-05 21:11:30,648 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 994 transitions. Word has length 38 [2021-10-05 21:11:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:30,649 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 994 transitions. [2021-10-05 21:11:30,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 994 transitions. [2021-10-05 21:11:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:30,649 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:30,650 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:30,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-10-05 21:11:30,650 INFO L402 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1170713261, now seen corresponding path program 185 times [2021-10-05 21:11:30,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:30,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149709833] [2021-10-05 21:11:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:30,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:30,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:30,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149709833] [2021-10-05 21:11:30,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149709833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:30,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:30,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:30,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772106613] [2021-10-05 21:11:30,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:30,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:30,750 INFO L87 Difference]: Start difference. First operand 438 states and 994 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:31,127 INFO L93 Difference]: Finished difference Result 678 states and 1524 transitions. [2021-10-05 21:11:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:31,128 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:31,130 INFO L225 Difference]: With dead ends: 678 [2021-10-05 21:11:31,130 INFO L226 Difference]: Without dead ends: 670 [2021-10-05 21:11:31,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 184.5ms TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-10-05 21:11:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 438. [2021-10-05 21:11:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.2700228832951943) internal successors, (992), 437 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 992 transitions. [2021-10-05 21:11:31,137 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 992 transitions. Word has length 38 [2021-10-05 21:11:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:31,138 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 992 transitions. [2021-10-05 21:11:31,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 992 transitions. [2021-10-05 21:11:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:31,139 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:31,139 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:31,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-10-05 21:11:31,139 INFO L402 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1365145225, now seen corresponding path program 186 times [2021-10-05 21:11:31,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:31,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892840563] [2021-10-05 21:11:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:31,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:31,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:31,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892840563] [2021-10-05 21:11:31,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892840563] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:31,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:31,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:31,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633679873] [2021-10-05 21:11:31,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:31,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:31,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:31,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:31,253 INFO L87 Difference]: Start difference. First operand 438 states and 992 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:31,696 INFO L93 Difference]: Finished difference Result 684 states and 1533 transitions. [2021-10-05 21:11:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:11:31,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:31,698 INFO L225 Difference]: With dead ends: 684 [2021-10-05 21:11:31,698 INFO L226 Difference]: Without dead ends: 676 [2021-10-05 21:11:31,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 232.5ms TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:11:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-05 21:11:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 436. [2021-10-05 21:11:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 2.268965517241379) internal successors, (987), 435 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 987 transitions. [2021-10-05 21:11:31,705 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 987 transitions. Word has length 38 [2021-10-05 21:11:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:31,705 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 987 transitions. [2021-10-05 21:11:31,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 987 transitions. [2021-10-05 21:11:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:31,706 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:31,706 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:31,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-10-05 21:11:31,707 INFO L402 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:31,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1125722323, now seen corresponding path program 187 times [2021-10-05 21:11:31,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:31,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180804994] [2021-10-05 21:11:31,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:31,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:31,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:31,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180804994] [2021-10-05 21:11:31,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180804994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:31,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:31,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:31,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280269534] [2021-10-05 21:11:31,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:31,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:31,823 INFO L87 Difference]: Start difference. First operand 436 states and 987 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:32,288 INFO L93 Difference]: Finished difference Result 646 states and 1456 transitions. [2021-10-05 21:11:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:11:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:32,290 INFO L225 Difference]: With dead ends: 646 [2021-10-05 21:11:32,290 INFO L226 Difference]: Without dead ends: 622 [2021-10-05 21:11:32,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 246.3ms TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2021-10-05 21:11:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2021-10-05 21:11:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 434. [2021-10-05 21:11:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.2678983833718247) internal successors, (982), 433 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 982 transitions. [2021-10-05 21:11:32,296 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 982 transitions. Word has length 38 [2021-10-05 21:11:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:32,296 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 982 transitions. [2021-10-05 21:11:32,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 982 transitions. [2021-10-05 21:11:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:32,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:32,297 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:32,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-10-05 21:11:32,297 INFO L402 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:32,298 INFO L82 PathProgramCache]: Analyzing trace with hash -505031305, now seen corresponding path program 188 times [2021-10-05 21:11:32,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:32,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896865356] [2021-10-05 21:11:32,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:32,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:32,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:32,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896865356] [2021-10-05 21:11:32,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896865356] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:32,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:32,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:32,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430769099] [2021-10-05 21:11:32,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:32,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:32,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:32,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:32,420 INFO L87 Difference]: Start difference. First operand 434 states and 982 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:32,803 INFO L93 Difference]: Finished difference Result 500 states and 1113 transitions. [2021-10-05 21:11:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:32,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:32,805 INFO L225 Difference]: With dead ends: 500 [2021-10-05 21:11:32,805 INFO L226 Difference]: Without dead ends: 480 [2021-10-05 21:11:32,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 189.8ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-05 21:11:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 428. [2021-10-05 21:11:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.2646370023419204) internal successors, (967), 427 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 967 transitions. [2021-10-05 21:11:32,810 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 967 transitions. Word has length 38 [2021-10-05 21:11:32,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:32,810 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 967 transitions. [2021-10-05 21:11:32,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 967 transitions. [2021-10-05 21:11:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:32,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:32,811 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:32,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-10-05 21:11:32,812 INFO L402 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1422086771, now seen corresponding path program 189 times [2021-10-05 21:11:32,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:32,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010978528] [2021-10-05 21:11:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:32,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:32,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:32,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010978528] [2021-10-05 21:11:32,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010978528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:32,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:32,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:32,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100366458] [2021-10-05 21:11:32,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:32,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:32,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:32,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:32,935 INFO L87 Difference]: Start difference. First operand 428 states and 967 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:33,412 INFO L93 Difference]: Finished difference Result 646 states and 1444 transitions. [2021-10-05 21:11:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:11:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:33,414 INFO L225 Difference]: With dead ends: 646 [2021-10-05 21:11:33,414 INFO L226 Difference]: Without dead ends: 600 [2021-10-05 21:11:33,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 252.1ms TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:11:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-05 21:11:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 412. [2021-10-05 21:11:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.274939172749392) internal successors, (935), 411 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 935 transitions. [2021-10-05 21:11:33,420 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 935 transitions. Word has length 38 [2021-10-05 21:11:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:33,420 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 935 transitions. [2021-10-05 21:11:33,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 935 transitions. [2021-10-05 21:11:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:33,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:33,421 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:33,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-10-05 21:11:33,421 INFO L402 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1596705233, now seen corresponding path program 190 times [2021-10-05 21:11:33,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:33,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626230103] [2021-10-05 21:11:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:33,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:33,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:33,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626230103] [2021-10-05 21:11:33,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626230103] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:33,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:33,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:33,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244314892] [2021-10-05 21:11:33,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:33,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:33,507 INFO L87 Difference]: Start difference. First operand 412 states and 935 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:33,796 INFO L93 Difference]: Finished difference Result 458 states and 1022 transitions. [2021-10-05 21:11:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:33,798 INFO L225 Difference]: With dead ends: 458 [2021-10-05 21:11:33,798 INFO L226 Difference]: Without dead ends: 446 [2021-10-05 21:11:33,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 136.8ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-10-05 21:11:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 418. [2021-10-05 21:11:33,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.26378896882494) internal successors, (944), 417 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 944 transitions. [2021-10-05 21:11:33,803 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 944 transitions. Word has length 38 [2021-10-05 21:11:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:33,803 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 944 transitions. [2021-10-05 21:11:33,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 944 transitions. [2021-10-05 21:11:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:33,804 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:33,804 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:33,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-10-05 21:11:33,804 INFO L402 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:33,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:33,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1301523613, now seen corresponding path program 191 times [2021-10-05 21:11:33,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:33,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212346030] [2021-10-05 21:11:33,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:33,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:33,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:33,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212346030] [2021-10-05 21:11:33,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212346030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:33,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:33,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:33,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326193962] [2021-10-05 21:11:33,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:33,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:33,896 INFO L87 Difference]: Start difference. First operand 418 states and 944 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:34,207 INFO L93 Difference]: Finished difference Result 536 states and 1175 transitions. [2021-10-05 21:11:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:34,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:34,208 INFO L225 Difference]: With dead ends: 536 [2021-10-05 21:11:34,209 INFO L226 Difference]: Without dead ends: 514 [2021-10-05 21:11:34,209 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 154.8ms TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-05 21:11:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 412. [2021-10-05 21:11:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.2457420924574207) internal successors, (923), 411 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 923 transitions. [2021-10-05 21:11:34,215 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 923 transitions. Word has length 38 [2021-10-05 21:11:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:34,215 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 923 transitions. [2021-10-05 21:11:34,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 923 transitions. [2021-10-05 21:11:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:34,216 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:34,216 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:34,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-10-05 21:11:34,217 INFO L402 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -867106687, now seen corresponding path program 192 times [2021-10-05 21:11:34,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:34,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111847844] [2021-10-05 21:11:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:34,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:34,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:34,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111847844] [2021-10-05 21:11:34,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111847844] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:34,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:34,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:34,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753772779] [2021-10-05 21:11:34,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:34,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:34,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:34,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:34,323 INFO L87 Difference]: Start difference. First operand 412 states and 923 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:34,661 INFO L93 Difference]: Finished difference Result 460 states and 1011 transitions. [2021-10-05 21:11:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:34,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:34,663 INFO L225 Difference]: With dead ends: 460 [2021-10-05 21:11:34,663 INFO L226 Difference]: Without dead ends: 440 [2021-10-05 21:11:34,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 162.8ms TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-10-05 21:11:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2021-10-05 21:11:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.231678486997636) internal successors, (944), 423 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 944 transitions. [2021-10-05 21:11:34,669 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 944 transitions. Word has length 38 [2021-10-05 21:11:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:34,669 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 944 transitions. [2021-10-05 21:11:34,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 944 transitions. [2021-10-05 21:11:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:34,670 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:34,670 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:34,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-10-05 21:11:34,671 INFO L402 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1028368227, now seen corresponding path program 193 times [2021-10-05 21:11:34,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:34,671 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603424605] [2021-10-05 21:11:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:34,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:34,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:34,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603424605] [2021-10-05 21:11:34,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603424605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:34,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:34,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:34,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229233230] [2021-10-05 21:11:34,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:34,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:34,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:34,799 INFO L87 Difference]: Start difference. First operand 424 states and 944 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:35,188 INFO L93 Difference]: Finished difference Result 516 states and 1115 transitions. [2021-10-05 21:11:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:35,189 INFO L225 Difference]: With dead ends: 516 [2021-10-05 21:11:35,189 INFO L226 Difference]: Without dead ends: 462 [2021-10-05 21:11:35,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 210.1ms TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:11:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-10-05 21:11:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2021-10-05 21:11:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.187347931873479) internal successors, (899), 411 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 899 transitions. [2021-10-05 21:11:35,195 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 899 transitions. Word has length 38 [2021-10-05 21:11:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:35,195 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 899 transitions. [2021-10-05 21:11:35,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 899 transitions. [2021-10-05 21:11:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:35,196 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:35,196 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:35,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-10-05 21:11:35,196 INFO L402 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:35,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1623623873, now seen corresponding path program 194 times [2021-10-05 21:11:35,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:35,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487677983] [2021-10-05 21:11:35,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:35,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:35,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:35,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487677983] [2021-10-05 21:11:35,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487677983] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:35,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:35,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:35,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330836135] [2021-10-05 21:11:35,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:35,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:35,309 INFO L87 Difference]: Start difference. First operand 412 states and 899 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:35,585 INFO L93 Difference]: Finished difference Result 508 states and 1090 transitions. [2021-10-05 21:11:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:35,585 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:35,586 INFO L225 Difference]: With dead ends: 508 [2021-10-05 21:11:35,586 INFO L226 Difference]: Without dead ends: 496 [2021-10-05 21:11:35,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 152.8ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-05 21:11:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 412. [2021-10-05 21:11:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.1824817518248176) internal successors, (897), 411 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 897 transitions. [2021-10-05 21:11:35,592 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 897 transitions. Word has length 38 [2021-10-05 21:11:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:35,592 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 897 transitions. [2021-10-05 21:11:35,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 897 transitions. [2021-10-05 21:11:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:35,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:35,593 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:35,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-10-05 21:11:35,593 INFO L402 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1377587217, now seen corresponding path program 195 times [2021-10-05 21:11:35,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:35,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823524832] [2021-10-05 21:11:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:35,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:35,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:35,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823524832] [2021-10-05 21:11:35,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823524832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:35,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:35,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:35,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614804610] [2021-10-05 21:11:35,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:35,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:35,715 INFO L87 Difference]: Start difference. First operand 412 states and 897 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:35,979 INFO L93 Difference]: Finished difference Result 484 states and 1036 transitions. [2021-10-05 21:11:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:35,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:35,981 INFO L225 Difference]: With dead ends: 484 [2021-10-05 21:11:35,981 INFO L226 Difference]: Without dead ends: 434 [2021-10-05 21:11:35,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 155.9ms TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-05 21:11:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 392. [2021-10-05 21:11:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 2.1943734015345266) internal successors, (858), 391 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 858 transitions. [2021-10-05 21:11:35,987 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 858 transitions. Word has length 38 [2021-10-05 21:11:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:35,987 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 858 transitions. [2021-10-05 21:11:35,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 858 transitions. [2021-10-05 21:11:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:35,988 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:35,988 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:35,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-10-05 21:11:35,988 INFO L402 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:35,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash -890695075, now seen corresponding path program 196 times [2021-10-05 21:11:35,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:35,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758059087] [2021-10-05 21:11:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:35,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:36,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:36,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758059087] [2021-10-05 21:11:36,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758059087] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:36,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:36,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:36,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563114455] [2021-10-05 21:11:36,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:36,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:36,104 INFO L87 Difference]: Start difference. First operand 392 states and 858 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:36,413 INFO L93 Difference]: Finished difference Result 414 states and 894 transitions. [2021-10-05 21:11:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:36,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:36,415 INFO L225 Difference]: With dead ends: 414 [2021-10-05 21:11:36,415 INFO L226 Difference]: Without dead ends: 402 [2021-10-05 21:11:36,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 192.1ms TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-10-05 21:11:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2021-10-05 21:11:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 2.1790281329923276) internal successors, (852), 391 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 852 transitions. [2021-10-05 21:11:36,421 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 852 transitions. Word has length 38 [2021-10-05 21:11:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:36,421 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 852 transitions. [2021-10-05 21:11:36,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 852 transitions. [2021-10-05 21:11:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:36,422 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:36,422 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:36,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-10-05 21:11:36,422 INFO L402 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 506043375, now seen corresponding path program 197 times [2021-10-05 21:11:36,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:36,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130568042] [2021-10-05 21:11:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:36,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:36,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:36,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130568042] [2021-10-05 21:11:36,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130568042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:36,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:36,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:36,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891218426] [2021-10-05 21:11:36,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:36,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:36,554 INFO L87 Difference]: Start difference. First operand 392 states and 852 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:36,886 INFO L93 Difference]: Finished difference Result 406 states and 876 transitions. [2021-10-05 21:11:36,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:36,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:36,888 INFO L225 Difference]: With dead ends: 406 [2021-10-05 21:11:36,888 INFO L226 Difference]: Without dead ends: 400 [2021-10-05 21:11:36,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 196.2ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-10-05 21:11:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 394. [2021-10-05 21:11:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.1755725190839694) internal successors, (855), 393 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 855 transitions. [2021-10-05 21:11:36,893 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 855 transitions. Word has length 38 [2021-10-05 21:11:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:36,893 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 855 transitions. [2021-10-05 21:11:36,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 855 transitions. [2021-10-05 21:11:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:36,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:36,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:36,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-10-05 21:11:36,894 INFO L402 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:36,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1768678713, now seen corresponding path program 198 times [2021-10-05 21:11:36,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:36,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406839183] [2021-10-05 21:11:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:36,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:37,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:37,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406839183] [2021-10-05 21:11:37,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406839183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:37,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:37,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:37,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488661934] [2021-10-05 21:11:37,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:37,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:37,019 INFO L87 Difference]: Start difference. First operand 394 states and 855 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:37,328 INFO L93 Difference]: Finished difference Result 468 states and 1006 transitions. [2021-10-05 21:11:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:37,330 INFO L225 Difference]: With dead ends: 468 [2021-10-05 21:11:37,330 INFO L226 Difference]: Without dead ends: 452 [2021-10-05 21:11:37,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 180.2ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-10-05 21:11:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 386. [2021-10-05 21:11:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 2.1844155844155844) internal successors, (841), 385 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 841 transitions. [2021-10-05 21:11:37,335 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 841 transitions. Word has length 38 [2021-10-05 21:11:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:37,335 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 841 transitions. [2021-10-05 21:11:37,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 841 transitions. [2021-10-05 21:11:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:37,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:37,336 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:37,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-10-05 21:11:37,336 INFO L402 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:37,337 INFO L82 PathProgramCache]: Analyzing trace with hash -677721011, now seen corresponding path program 199 times [2021-10-05 21:11:37,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:37,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993886215] [2021-10-05 21:11:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:37,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:37,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:37,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993886215] [2021-10-05 21:11:37,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993886215] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:37,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:37,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:37,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823659631] [2021-10-05 21:11:37,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:37,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:37,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:37,454 INFO L87 Difference]: Start difference. First operand 386 states and 841 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:37,737 INFO L93 Difference]: Finished difference Result 406 states and 872 transitions. [2021-10-05 21:11:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:37,739 INFO L225 Difference]: With dead ends: 406 [2021-10-05 21:11:37,739 INFO L226 Difference]: Without dead ends: 390 [2021-10-05 21:11:37,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 169.8ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-05 21:11:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2021-10-05 21:11:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 2.1827676240208875) internal successors, (836), 383 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 836 transitions. [2021-10-05 21:11:37,743 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 836 transitions. Word has length 38 [2021-10-05 21:11:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:37,744 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 836 transitions. [2021-10-05 21:11:37,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 836 transitions. [2021-10-05 21:11:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:37,744 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:37,744 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:37,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-10-05 21:11:37,745 INFO L402 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2055203981, now seen corresponding path program 200 times [2021-10-05 21:11:37,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:37,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370512151] [2021-10-05 21:11:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:37,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:37,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:37,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370512151] [2021-10-05 21:11:37,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370512151] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:37,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:37,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:37,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404848190] [2021-10-05 21:11:37,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:37,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:37,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:37,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:37,860 INFO L87 Difference]: Start difference. First operand 384 states and 836 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:38,165 INFO L93 Difference]: Finished difference Result 434 states and 933 transitions. [2021-10-05 21:11:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:38,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:38,167 INFO L225 Difference]: With dead ends: 434 [2021-10-05 21:11:38,167 INFO L226 Difference]: Without dead ends: 422 [2021-10-05 21:11:38,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 173.3ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-05 21:11:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 378. [2021-10-05 21:11:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.1777188328912467) internal successors, (821), 377 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 821 transitions. [2021-10-05 21:11:38,172 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 821 transitions. Word has length 38 [2021-10-05 21:11:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:38,173 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 821 transitions. [2021-10-05 21:11:38,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 821 transitions. [2021-10-05 21:11:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:38,173 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:38,174 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:38,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-10-05 21:11:38,174 INFO L402 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1809167325, now seen corresponding path program 201 times [2021-10-05 21:11:38,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:38,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355803975] [2021-10-05 21:11:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:38,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:38,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:38,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355803975] [2021-10-05 21:11:38,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355803975] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:38,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:38,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:38,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026012253] [2021-10-05 21:11:38,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:38,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:38,305 INFO L87 Difference]: Start difference. First operand 378 states and 821 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:38,652 INFO L93 Difference]: Finished difference Result 442 states and 943 transitions. [2021-10-05 21:11:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:38,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:38,654 INFO L225 Difference]: With dead ends: 442 [2021-10-05 21:11:38,654 INFO L226 Difference]: Without dead ends: 412 [2021-10-05 21:11:38,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 201.9ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-10-05 21:11:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 378. [2021-10-05 21:11:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.1671087533156497) internal successors, (817), 377 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 817 transitions. [2021-10-05 21:11:38,658 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 817 transitions. Word has length 38 [2021-10-05 21:11:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:38,659 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 817 transitions. [2021-10-05 21:11:38,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 817 transitions. [2021-10-05 21:11:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:38,659 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:38,659 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:38,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-10-05 21:11:38,660 INFO L402 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1749740493, now seen corresponding path program 202 times [2021-10-05 21:11:38,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:38,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729739501] [2021-10-05 21:11:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:38,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:38,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:38,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729739501] [2021-10-05 21:11:38,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729739501] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:38,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:38,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:38,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917936791] [2021-10-05 21:11:38,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:38,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:38,774 INFO L87 Difference]: Start difference. First operand 378 states and 817 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:39,024 INFO L93 Difference]: Finished difference Result 434 states and 924 transitions. [2021-10-05 21:11:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:39,026 INFO L225 Difference]: With dead ends: 434 [2021-10-05 21:11:39,026 INFO L226 Difference]: Without dead ends: 390 [2021-10-05 21:11:39,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 147.4ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-05 21:11:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 358. [2021-10-05 21:11:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.179271708683473) internal successors, (778), 357 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 778 transitions. [2021-10-05 21:11:39,030 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 778 transitions. Word has length 38 [2021-10-05 21:11:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:39,030 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 778 transitions. [2021-10-05 21:11:39,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 778 transitions. [2021-10-05 21:11:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:39,031 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:39,031 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:39,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-10-05 21:11:39,031 INFO L402 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash 253520797, now seen corresponding path program 203 times [2021-10-05 21:11:39,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:39,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775081744] [2021-10-05 21:11:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:39,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:39,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:39,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775081744] [2021-10-05 21:11:39,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775081744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:39,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:39,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:39,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360853297] [2021-10-05 21:11:39,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:39,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:39,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:39,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:39,144 INFO L87 Difference]: Start difference. First operand 358 states and 778 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:39,363 INFO L93 Difference]: Finished difference Result 378 states and 810 transitions. [2021-10-05 21:11:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:39,365 INFO L225 Difference]: With dead ends: 378 [2021-10-05 21:11:39,365 INFO L226 Difference]: Without dead ends: 356 [2021-10-05 21:11:39,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 139.8ms TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-05 21:11:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2021-10-05 21:11:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.1774647887323946) internal successors, (773), 355 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 773 transitions. [2021-10-05 21:11:39,372 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 773 transitions. Word has length 38 [2021-10-05 21:11:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:39,372 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 773 transitions. [2021-10-05 21:11:39,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 773 transitions. [2021-10-05 21:11:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:39,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:39,373 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:39,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-10-05 21:11:39,374 INFO L402 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1871702109, now seen corresponding path program 204 times [2021-10-05 21:11:39,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:39,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193227917] [2021-10-05 21:11:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:39,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:39,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-10-05 21:11:39,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:39,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193227917] [2021-10-05 21:11:39,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193227917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:39,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:39,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:39,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668994609] [2021-10-05 21:11:39,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:39,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:39,497 INFO L87 Difference]: Start difference. First operand 356 states and 773 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:39,724 INFO L93 Difference]: Finished difference Result 370 states and 796 transitions. [2021-10-05 21:11:39,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:39,726 INFO L225 Difference]: With dead ends: 370 [2021-10-05 21:11:39,726 INFO L226 Difference]: Without dead ends: 350 [2021-10-05 21:11:39,726 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 146.5ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-10-05 21:11:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2021-10-05 21:11:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.171919770773639) internal successors, (758), 349 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 758 transitions. [2021-10-05 21:11:39,732 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 758 transitions. Word has length 38 [2021-10-05 21:11:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:39,733 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 758 transitions. [2021-10-05 21:11:39,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 758 transitions. [2021-10-05 21:11:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:39,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:39,734 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:39,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-10-05 21:11:39,734 INFO L402 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash -527790273, now seen corresponding path program 205 times [2021-10-05 21:11:39,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:39,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435204228] [2021-10-05 21:11:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:39,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:39,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:39,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435204228] [2021-10-05 21:11:39,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435204228] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:39,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:39,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:39,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484647855] [2021-10-05 21:11:39,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:39,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:39,867 INFO L87 Difference]: Start difference. First operand 350 states and 758 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:40,145 INFO L93 Difference]: Finished difference Result 362 states and 778 transitions. [2021-10-05 21:11:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:40,146 INFO L225 Difference]: With dead ends: 362 [2021-10-05 21:11:40,146 INFO L226 Difference]: Without dead ends: 348 [2021-10-05 21:11:40,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 165.1ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-10-05 21:11:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2021-10-05 21:11:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.170028818443804) internal successors, (753), 347 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 753 transitions. [2021-10-05 21:11:40,151 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 753 transitions. Word has length 38 [2021-10-05 21:11:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:40,151 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 753 transitions. [2021-10-05 21:11:40,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 753 transitions. [2021-10-05 21:11:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:40,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:40,152 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:40,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-10-05 21:11:40,152 INFO L402 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1074206919, now seen corresponding path program 206 times [2021-10-05 21:11:40,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:40,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008964461] [2021-10-05 21:11:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:40,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:40,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:40,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008964461] [2021-10-05 21:11:40,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008964461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:40,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:40,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:40,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969621934] [2021-10-05 21:11:40,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:40,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:40,279 INFO L87 Difference]: Start difference. First operand 348 states and 753 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:40,530 INFO L93 Difference]: Finished difference Result 320 states and 691 transitions. [2021-10-05 21:11:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:40,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:40,532 INFO L225 Difference]: With dead ends: 320 [2021-10-05 21:11:40,532 INFO L226 Difference]: Without dead ends: 256 [2021-10-05 21:11:40,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 160.5ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-05 21:11:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2021-10-05 21:11:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.2509803921568627) internal successors, (574), 255 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 574 transitions. [2021-10-05 21:11:40,535 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 574 transitions. Word has length 38 [2021-10-05 21:11:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:40,535 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 574 transitions. [2021-10-05 21:11:40,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 574 transitions. [2021-10-05 21:11:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:40,536 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:40,536 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:40,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-10-05 21:11:40,536 INFO L402 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1513261835, now seen corresponding path program 207 times [2021-10-05 21:11:40,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:40,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422311464] [2021-10-05 21:11:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:40,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:40,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:40,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422311464] [2021-10-05 21:11:40,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422311464] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:40,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:40,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:40,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109322689] [2021-10-05 21:11:40,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:40,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:40,640 INFO L87 Difference]: Start difference. First operand 256 states and 574 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:40,899 INFO L93 Difference]: Finished difference Result 354 states and 759 transitions. [2021-10-05 21:11:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:40,901 INFO L225 Difference]: With dead ends: 354 [2021-10-05 21:11:40,901 INFO L226 Difference]: Without dead ends: 342 [2021-10-05 21:11:40,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 99.3ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-05 21:11:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 264. [2021-10-05 21:11:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.23574144486692) internal successors, (588), 263 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 588 transitions. [2021-10-05 21:11:40,906 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 588 transitions. Word has length 38 [2021-10-05 21:11:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:40,906 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 588 transitions. [2021-10-05 21:11:40,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 588 transitions. [2021-10-05 21:11:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:40,906 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:40,907 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:40,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-10-05 21:11:40,907 INFO L402 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash 899282349, now seen corresponding path program 208 times [2021-10-05 21:11:40,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:40,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431942857] [2021-10-05 21:11:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:40,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:41,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:41,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431942857] [2021-10-05 21:11:41,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431942857] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:41,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:41,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:41,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769743617] [2021-10-05 21:11:41,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:41,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:41,024 INFO L87 Difference]: Start difference. First operand 264 states and 588 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:41,298 INFO L93 Difference]: Finished difference Result 388 states and 842 transitions. [2021-10-05 21:11:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:41,299 INFO L225 Difference]: With dead ends: 388 [2021-10-05 21:11:41,299 INFO L226 Difference]: Without dead ends: 380 [2021-10-05 21:11:41,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 133.8ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-05 21:11:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2021-10-05 21:11:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.230188679245283) internal successors, (591), 265 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 591 transitions. [2021-10-05 21:11:41,303 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 591 transitions. Word has length 38 [2021-10-05 21:11:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:41,304 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 591 transitions. [2021-10-05 21:11:41,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 591 transitions. [2021-10-05 21:11:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:41,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:41,304 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:41,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-10-05 21:11:41,305 INFO L402 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1620453277, now seen corresponding path program 209 times [2021-10-05 21:11:41,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:41,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169369801] [2021-10-05 21:11:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:41,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:41,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:41,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169369801] [2021-10-05 21:11:41,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169369801] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:41,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:41,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:41,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630095790] [2021-10-05 21:11:41,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:41,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:41,424 INFO L87 Difference]: Start difference. First operand 266 states and 591 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:41,716 INFO L93 Difference]: Finished difference Result 330 states and 715 transitions. [2021-10-05 21:11:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:41,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:41,718 INFO L225 Difference]: With dead ends: 330 [2021-10-05 21:11:41,718 INFO L226 Difference]: Without dead ends: 316 [2021-10-05 21:11:41,718 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 145.4ms TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-05 21:11:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2021-10-05 21:11:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.245136186770428) internal successors, (577), 257 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 577 transitions. [2021-10-05 21:11:41,721 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 577 transitions. Word has length 38 [2021-10-05 21:11:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:41,722 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 577 transitions. [2021-10-05 21:11:41,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 577 transitions. [2021-10-05 21:11:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:41,722 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:41,722 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:41,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-10-05 21:11:41,723 INFO L402 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash 477624089, now seen corresponding path program 210 times [2021-10-05 21:11:41,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:41,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807329712] [2021-10-05 21:11:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:41,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:41,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:41,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807329712] [2021-10-05 21:11:41,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807329712] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:41,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:41,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:41,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851466277] [2021-10-05 21:11:41,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:41,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:41,829 INFO L87 Difference]: Start difference. First operand 258 states and 577 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:42,082 INFO L93 Difference]: Finished difference Result 292 states and 632 transitions. [2021-10-05 21:11:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:42,083 INFO L225 Difference]: With dead ends: 292 [2021-10-05 21:11:42,083 INFO L226 Difference]: Without dead ends: 276 [2021-10-05 21:11:42,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 99.7ms TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-05 21:11:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 256. [2021-10-05 21:11:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.243137254901961) internal successors, (572), 255 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 572 transitions. [2021-10-05 21:11:42,088 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 572 transitions. Word has length 38 [2021-10-05 21:11:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:42,088 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 572 transitions. [2021-10-05 21:11:42,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 572 transitions. [2021-10-05 21:11:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:42,089 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:42,089 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:42,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-10-05 21:11:42,089 INFO L402 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash -981866119, now seen corresponding path program 211 times [2021-10-05 21:11:42,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:42,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731743858] [2021-10-05 21:11:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:42,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:42,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:42,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731743858] [2021-10-05 21:11:42,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731743858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:42,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:42,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:42,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132380224] [2021-10-05 21:11:42,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:42,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:42,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:42,202 INFO L87 Difference]: Start difference. First operand 256 states and 572 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:42,427 INFO L93 Difference]: Finished difference Result 296 states and 630 transitions. [2021-10-05 21:11:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:11:42,428 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:42,429 INFO L225 Difference]: With dead ends: 296 [2021-10-05 21:11:42,429 INFO L226 Difference]: Without dead ends: 270 [2021-10-05 21:11:42,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 100.3ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-05 21:11:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 250. [2021-10-05 21:11:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.2208835341365463) internal successors, (553), 249 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 553 transitions. [2021-10-05 21:11:42,432 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 553 transitions. Word has length 38 [2021-10-05 21:11:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:42,433 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 553 transitions. [2021-10-05 21:11:42,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 553 transitions. [2021-10-05 21:11:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:42,433 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:42,433 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:42,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-10-05 21:11:42,434 INFO L402 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash 611942947, now seen corresponding path program 212 times [2021-10-05 21:11:42,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:42,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483358818] [2021-10-05 21:11:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:42,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:42,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-10-05 21:11:42,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:42,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483358818] [2021-10-05 21:11:42,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483358818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:42,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:42,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:42,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620500528] [2021-10-05 21:11:42,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:42,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:42,564 INFO L87 Difference]: Start difference. First operand 250 states and 553 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:42,919 INFO L93 Difference]: Finished difference Result 378 states and 813 transitions. [2021-10-05 21:11:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:42,921 INFO L225 Difference]: With dead ends: 378 [2021-10-05 21:11:42,921 INFO L226 Difference]: Without dead ends: 366 [2021-10-05 21:11:42,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 179.7ms TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-10-05 21:11:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 260. [2021-10-05 21:11:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.2162162162162162) internal successors, (574), 259 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 574 transitions. [2021-10-05 21:11:42,925 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 574 transitions. Word has length 38 [2021-10-05 21:11:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:42,925 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 574 transitions. [2021-10-05 21:11:42,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 574 transitions. [2021-10-05 21:11:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:42,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:42,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:42,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-10-05 21:11:42,926 INFO L402 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1270480165, now seen corresponding path program 213 times [2021-10-05 21:11:42,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:42,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770537644] [2021-10-05 21:11:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:42,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:43,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:43,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770537644] [2021-10-05 21:11:43,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770537644] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:43,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:43,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:43,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023281584] [2021-10-05 21:11:43,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:43,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:43,055 INFO L87 Difference]: Start difference. First operand 260 states and 574 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:43,393 INFO L93 Difference]: Finished difference Result 488 states and 1076 transitions. [2021-10-05 21:11:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:43,394 INFO L225 Difference]: With dead ends: 488 [2021-10-05 21:11:43,395 INFO L226 Difference]: Without dead ends: 480 [2021-10-05 21:11:43,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 171.1ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-10-05 21:11:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 274. [2021-10-05 21:11:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.2454212454212454) internal successors, (613), 273 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 613 transitions. [2021-10-05 21:11:43,400 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 613 transitions. Word has length 38 [2021-10-05 21:11:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:43,400 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 613 transitions. [2021-10-05 21:11:43,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 613 transitions. [2021-10-05 21:11:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:43,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:43,401 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:43,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-10-05 21:11:43,401 INFO L402 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash -549309237, now seen corresponding path program 214 times [2021-10-05 21:11:43,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:43,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681677904] [2021-10-05 21:11:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:43,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:43,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:43,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681677904] [2021-10-05 21:11:43,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681677904] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:43,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:43,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:43,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010422644] [2021-10-05 21:11:43,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:43,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:43,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:43,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:43,531 INFO L87 Difference]: Start difference. First operand 274 states and 613 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:43,852 INFO L93 Difference]: Finished difference Result 352 states and 768 transitions. [2021-10-05 21:11:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:43,853 INFO L225 Difference]: With dead ends: 352 [2021-10-05 21:11:43,853 INFO L226 Difference]: Without dead ends: 338 [2021-10-05 21:11:43,853 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 187.1ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-05 21:11:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2021-10-05 21:11:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 2.254681647940075) internal successors, (602), 267 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 602 transitions. [2021-10-05 21:11:43,857 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 602 transitions. Word has length 38 [2021-10-05 21:11:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:43,858 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 602 transitions. [2021-10-05 21:11:43,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 602 transitions. [2021-10-05 21:11:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:43,858 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:43,858 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:43,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2021-10-05 21:11:43,859 INFO L402 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1692138425, now seen corresponding path program 215 times [2021-10-05 21:11:43,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:43,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58122839] [2021-10-05 21:11:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:43,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:43,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:43,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58122839] [2021-10-05 21:11:43,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58122839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:43,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:43,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:43,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359677463] [2021-10-05 21:11:43,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:43,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:43,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:43,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:43,978 INFO L87 Difference]: Start difference. First operand 268 states and 602 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:44,299 INFO L93 Difference]: Finished difference Result 346 states and 749 transitions. [2021-10-05 21:11:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:44,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:44,300 INFO L225 Difference]: With dead ends: 346 [2021-10-05 21:11:44,301 INFO L226 Difference]: Without dead ends: 330 [2021-10-05 21:11:44,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 172.1ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-05 21:11:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 266. [2021-10-05 21:11:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.2528301886792454) internal successors, (597), 265 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 597 transitions. [2021-10-05 21:11:44,304 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 597 transitions. Word has length 38 [2021-10-05 21:11:44,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:44,304 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 597 transitions. [2021-10-05 21:11:44,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 597 transitions. [2021-10-05 21:11:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:44,305 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:44,305 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:44,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-10-05 21:11:44,305 INFO L402 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash 208949539, now seen corresponding path program 216 times [2021-10-05 21:11:44,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:44,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349212320] [2021-10-05 21:11:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:44,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:44,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:44,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349212320] [2021-10-05 21:11:44,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349212320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:44,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:44,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:44,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899531861] [2021-10-05 21:11:44,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:44,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:44,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:44,413 INFO L87 Difference]: Start difference. First operand 266 states and 597 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:44,706 INFO L93 Difference]: Finished difference Result 392 states and 864 transitions. [2021-10-05 21:11:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:44,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:44,708 INFO L225 Difference]: With dead ends: 392 [2021-10-05 21:11:44,708 INFO L226 Difference]: Without dead ends: 380 [2021-10-05 21:11:44,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 130.0ms TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-05 21:11:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 266. [2021-10-05 21:11:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.230188679245283) internal successors, (591), 265 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 591 transitions. [2021-10-05 21:11:44,712 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 591 transitions. Word has length 38 [2021-10-05 21:11:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:44,712 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 591 transitions. [2021-10-05 21:11:44,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 591 transitions. [2021-10-05 21:11:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:44,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:44,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-10-05 21:11:44,713 INFO L402 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash -952302645, now seen corresponding path program 217 times [2021-10-05 21:11:44,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:44,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263454800] [2021-10-05 21:11:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:44,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:44,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:44,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263454800] [2021-10-05 21:11:44,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263454800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:44,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:44,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:44,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304850686] [2021-10-05 21:11:44,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:44,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:44,831 INFO L87 Difference]: Start difference. First operand 266 states and 591 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:45,153 INFO L93 Difference]: Finished difference Result 452 states and 986 transitions. [2021-10-05 21:11:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:45,154 INFO L225 Difference]: With dead ends: 452 [2021-10-05 21:11:45,154 INFO L226 Difference]: Without dead ends: 438 [2021-10-05 21:11:45,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 153.9ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-05 21:11:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 258. [2021-10-05 21:11:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.2295719844357977) internal successors, (573), 257 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 573 transitions. [2021-10-05 21:11:45,158 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 573 transitions. Word has length 38 [2021-10-05 21:11:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:45,158 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 573 transitions. [2021-10-05 21:11:45,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 573 transitions. [2021-10-05 21:11:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:45,159 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:45,159 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:45,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2021-10-05 21:11:45,159 INFO L402 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1494099015, now seen corresponding path program 218 times [2021-10-05 21:11:45,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:45,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058797067] [2021-10-05 21:11:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:45,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:45,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:45,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058797067] [2021-10-05 21:11:45,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058797067] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:45,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:45,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:45,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579799043] [2021-10-05 21:11:45,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:45,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:45,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:45,284 INFO L87 Difference]: Start difference. First operand 258 states and 573 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:45,670 INFO L93 Difference]: Finished difference Result 384 states and 844 transitions. [2021-10-05 21:11:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:45,671 INFO L225 Difference]: With dead ends: 384 [2021-10-05 21:11:45,671 INFO L226 Difference]: Without dead ends: 364 [2021-10-05 21:11:45,672 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 191.3ms TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-05 21:11:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 264. [2021-10-05 21:11:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.2129277566539924) internal successors, (582), 263 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 582 transitions. [2021-10-05 21:11:45,675 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 582 transitions. Word has length 38 [2021-10-05 21:11:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:45,676 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 582 transitions. [2021-10-05 21:11:45,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 582 transitions. [2021-10-05 21:11:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:45,676 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:45,676 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:45,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-10-05 21:11:45,677 INFO L402 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:45,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash 609161861, now seen corresponding path program 219 times [2021-10-05 21:11:45,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:45,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784280744] [2021-10-05 21:11:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:45,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:45,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:45,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784280744] [2021-10-05 21:11:45,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784280744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:45,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:45,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:45,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196559712] [2021-10-05 21:11:45,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:45,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:45,771 INFO L87 Difference]: Start difference. First operand 264 states and 582 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:46,041 INFO L93 Difference]: Finished difference Result 408 states and 896 transitions. [2021-10-05 21:11:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:46,042 INFO L225 Difference]: With dead ends: 408 [2021-10-05 21:11:46,042 INFO L226 Difference]: Without dead ends: 390 [2021-10-05 21:11:46,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 107.6ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:46,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-05 21:11:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 266. [2021-10-05 21:11:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.207547169811321) internal successors, (585), 265 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 585 transitions. [2021-10-05 21:11:46,046 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 585 transitions. Word has length 38 [2021-10-05 21:11:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:46,047 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 585 transitions. [2021-10-05 21:11:46,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 585 transitions. [2021-10-05 21:11:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:46,047 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:46,047 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:46,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2021-10-05 21:11:46,048 INFO L402 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -136840501, now seen corresponding path program 220 times [2021-10-05 21:11:46,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:46,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125316588] [2021-10-05 21:11:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:46,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:46,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:46,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125316588] [2021-10-05 21:11:46,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125316588] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:46,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:46,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:46,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461446750] [2021-10-05 21:11:46,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:46,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:46,146 INFO L87 Difference]: Start difference. First operand 266 states and 585 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:46,456 INFO L93 Difference]: Finished difference Result 404 states and 884 transitions. [2021-10-05 21:11:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:46,457 INFO L225 Difference]: With dead ends: 404 [2021-10-05 21:11:46,458 INFO L226 Difference]: Without dead ends: 382 [2021-10-05 21:11:46,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 140.1ms TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-10-05 21:11:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 258. [2021-10-05 21:11:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.2062256809338523) internal successors, (567), 257 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 567 transitions. [2021-10-05 21:11:46,461 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 567 transitions. Word has length 38 [2021-10-05 21:11:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:46,462 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 567 transitions. [2021-10-05 21:11:46,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 567 transitions. [2021-10-05 21:11:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:46,462 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:46,462 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:46,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-10-05 21:11:46,463 INFO L402 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:46,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:46,463 INFO L82 PathProgramCache]: Analyzing trace with hash 916414243, now seen corresponding path program 221 times [2021-10-05 21:11:46,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:46,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655118918] [2021-10-05 21:11:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:46,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:46,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:46,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655118918] [2021-10-05 21:11:46,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655118918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:46,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:46,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:46,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538900663] [2021-10-05 21:11:46,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:46,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:46,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:46,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:46,565 INFO L87 Difference]: Start difference. First operand 258 states and 567 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:46,803 INFO L93 Difference]: Finished difference Result 416 states and 914 transitions. [2021-10-05 21:11:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:46,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:46,805 INFO L225 Difference]: With dead ends: 416 [2021-10-05 21:11:46,805 INFO L226 Difference]: Without dead ends: 408 [2021-10-05 21:11:46,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 114.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-10-05 21:11:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 262. [2021-10-05 21:11:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.210727969348659) internal successors, (577), 261 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 577 transitions. [2021-10-05 21:11:46,809 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 577 transitions. Word has length 38 [2021-10-05 21:11:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:46,809 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 577 transitions. [2021-10-05 21:11:46,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 577 transitions. [2021-10-05 21:11:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:46,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:46,810 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:46,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-10-05 21:11:46,810 INFO L402 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1911379763, now seen corresponding path program 222 times [2021-10-05 21:11:46,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:46,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068161329] [2021-10-05 21:11:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:46,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:46,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:46,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068161329] [2021-10-05 21:11:46,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068161329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:46,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:46,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:46,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917019359] [2021-10-05 21:11:46,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:46,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:46,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:46,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:46,928 INFO L87 Difference]: Start difference. First operand 262 states and 577 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:47,181 INFO L93 Difference]: Finished difference Result 408 states and 892 transitions. [2021-10-05 21:11:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:47,183 INFO L225 Difference]: With dead ends: 408 [2021-10-05 21:11:47,183 INFO L226 Difference]: Without dead ends: 388 [2021-10-05 21:11:47,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 131.7ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-05 21:11:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 260. [2021-10-05 21:11:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.2084942084942085) internal successors, (572), 259 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 572 transitions. [2021-10-05 21:11:47,187 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 572 transitions. Word has length 38 [2021-10-05 21:11:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:47,187 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 572 transitions. [2021-10-05 21:11:47,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 572 transitions. [2021-10-05 21:11:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:47,188 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:47,188 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:47,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2021-10-05 21:11:47,188 INFO L402 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -692991017, now seen corresponding path program 223 times [2021-10-05 21:11:47,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:47,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852879207] [2021-10-05 21:11:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:47,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:47,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-10-05 21:11:47,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:47,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852879207] [2021-10-05 21:11:47,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852879207] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:47,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:47,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:47,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087588722] [2021-10-05 21:11:47,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:47,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:47,299 INFO L87 Difference]: Start difference. First operand 260 states and 572 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:47,538 INFO L93 Difference]: Finished difference Result 382 states and 837 transitions. [2021-10-05 21:11:47,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:47,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:47,540 INFO L225 Difference]: With dead ends: 382 [2021-10-05 21:11:47,540 INFO L226 Difference]: Without dead ends: 374 [2021-10-05 21:11:47,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 115.1ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-10-05 21:11:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 262. [2021-10-05 21:11:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.203065134099617) internal successors, (575), 261 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 575 transitions. [2021-10-05 21:11:47,547 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 575 transitions. Word has length 38 [2021-10-05 21:11:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:47,548 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 575 transitions. [2021-10-05 21:11:47,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 575 transitions. [2021-10-05 21:11:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:47,549 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:47,549 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:47,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2021-10-05 21:11:47,549 INFO L402 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:47,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash 28179911, now seen corresponding path program 224 times [2021-10-05 21:11:47,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:47,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161683971] [2021-10-05 21:11:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:47,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:47,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:47,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161683971] [2021-10-05 21:11:47,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161683971] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:47,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:47,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:47,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104791675] [2021-10-05 21:11:47,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:47,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:47,681 INFO L87 Difference]: Start difference. First operand 262 states and 575 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:47,971 INFO L93 Difference]: Finished difference Result 380 states and 830 transitions. [2021-10-05 21:11:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:47,973 INFO L225 Difference]: With dead ends: 380 [2021-10-05 21:11:47,973 INFO L226 Difference]: Without dead ends: 372 [2021-10-05 21:11:47,973 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 144.3ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-05 21:11:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 260. [2021-10-05 21:11:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.200772200772201) internal successors, (570), 259 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 570 transitions. [2021-10-05 21:11:47,980 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 570 transitions. Word has length 38 [2021-10-05 21:11:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:47,980 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 570 transitions. [2021-10-05 21:11:47,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 570 transitions. [2021-10-05 21:11:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:47,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:47,982 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:47,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-10-05 21:11:47,982 INFO L402 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1029917475, now seen corresponding path program 225 times [2021-10-05 21:11:47,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:47,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475486780] [2021-10-05 21:11:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:47,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:48,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:48,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475486780] [2021-10-05 21:11:48,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475486780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:48,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:48,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:48,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048841352] [2021-10-05 21:11:48,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:48,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:48,103 INFO L87 Difference]: Start difference. First operand 260 states and 570 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:48,383 INFO L93 Difference]: Finished difference Result 374 states and 815 transitions. [2021-10-05 21:11:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:48,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:48,385 INFO L225 Difference]: With dead ends: 374 [2021-10-05 21:11:48,385 INFO L226 Difference]: Without dead ends: 356 [2021-10-05 21:11:48,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 152.8ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-05 21:11:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 262. [2021-10-05 21:11:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.1954022988505746) internal successors, (573), 261 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 573 transitions. [2021-10-05 21:11:48,389 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 573 transitions. Word has length 38 [2021-10-05 21:11:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:48,389 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 573 transitions. [2021-10-05 21:11:48,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 573 transitions. [2021-10-05 21:11:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:48,390 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:48,390 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:48,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-10-05 21:11:48,390 INFO L402 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1775919837, now seen corresponding path program 226 times [2021-10-05 21:11:48,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:48,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462578028] [2021-10-05 21:11:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:48,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:48,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:48,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462578028] [2021-10-05 21:11:48,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462578028] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:48,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:48,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:48,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665065283] [2021-10-05 21:11:48,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:48,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:48,523 INFO L87 Difference]: Start difference. First operand 262 states and 573 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:48,888 INFO L93 Difference]: Finished difference Result 370 states and 803 transitions. [2021-10-05 21:11:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:48,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:48,889 INFO L225 Difference]: With dead ends: 370 [2021-10-05 21:11:48,889 INFO L226 Difference]: Without dead ends: 346 [2021-10-05 21:11:48,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 196.9ms TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-10-05 21:11:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 252. [2021-10-05 21:11:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.2151394422310755) internal successors, (556), 251 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 556 transitions. [2021-10-05 21:11:48,894 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 556 transitions. Word has length 38 [2021-10-05 21:11:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:48,894 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 556 transitions. [2021-10-05 21:11:48,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 556 transitions. [2021-10-05 21:11:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:48,895 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:48,895 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:48,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-10-05 21:11:48,895 INFO L402 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -507210333, now seen corresponding path program 227 times [2021-10-05 21:11:48,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:48,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297231038] [2021-10-05 21:11:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:48,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:49,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:49,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297231038] [2021-10-05 21:11:49,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297231038] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:49,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:49,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:49,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567773308] [2021-10-05 21:11:49,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:49,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:49,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:49,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:49,036 INFO L87 Difference]: Start difference. First operand 252 states and 556 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:49,440 INFO L93 Difference]: Finished difference Result 304 states and 652 transitions. [2021-10-05 21:11:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:11:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:49,441 INFO L225 Difference]: With dead ends: 304 [2021-10-05 21:11:49,441 INFO L226 Difference]: Without dead ends: 282 [2021-10-05 21:11:49,442 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 265.7ms TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:11:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-10-05 21:11:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 254. [2021-10-05 21:11:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.2094861660079053) internal successors, (559), 253 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 559 transitions. [2021-10-05 21:11:49,446 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 559 transitions. Word has length 38 [2021-10-05 21:11:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:49,446 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 559 transitions. [2021-10-05 21:11:49,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 559 transitions. [2021-10-05 21:11:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:49,447 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:49,447 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:49,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2021-10-05 21:11:49,447 INFO L402 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1212946781, now seen corresponding path program 228 times [2021-10-05 21:11:49,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:49,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575393764] [2021-10-05 21:11:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:49,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:49,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:49,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575393764] [2021-10-05 21:11:49,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575393764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:49,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:49,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:49,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418008095] [2021-10-05 21:11:49,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:49,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:49,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:49,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:49,588 INFO L87 Difference]: Start difference. First operand 254 states and 559 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:50,029 INFO L93 Difference]: Finished difference Result 344 states and 734 transitions. [2021-10-05 21:11:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-05 21:11:50,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:50,030 INFO L225 Difference]: With dead ends: 344 [2021-10-05 21:11:50,031 INFO L226 Difference]: Without dead ends: 324 [2021-10-05 21:11:50,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 258.6ms TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:11:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-05 21:11:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 260. [2021-10-05 21:11:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 2.193050193050193) internal successors, (568), 259 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 568 transitions. [2021-10-05 21:11:50,035 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 568 transitions. Word has length 38 [2021-10-05 21:11:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:50,035 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 568 transitions. [2021-10-05 21:11:50,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 568 transitions. [2021-10-05 21:11:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:50,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:50,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2021-10-05 21:11:50,036 INFO L402 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2097883935, now seen corresponding path program 229 times [2021-10-05 21:11:50,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:50,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577101463] [2021-10-05 21:11:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:50,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:50,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:50,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577101463] [2021-10-05 21:11:50,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577101463] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:50,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:50,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:50,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976980301] [2021-10-05 21:11:50,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:50,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:50,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:50,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:50,164 INFO L87 Difference]: Start difference. First operand 260 states and 568 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:50,481 INFO L93 Difference]: Finished difference Result 414 states and 893 transitions. [2021-10-05 21:11:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:50,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:50,483 INFO L225 Difference]: With dead ends: 414 [2021-10-05 21:11:50,483 INFO L226 Difference]: Without dead ends: 396 [2021-10-05 21:11:50,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 155.5ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-10-05 21:11:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 262. [2021-10-05 21:11:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.1877394636015324) internal successors, (571), 261 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 571 transitions. [2021-10-05 21:11:50,492 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 571 transitions. Word has length 38 [2021-10-05 21:11:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:50,493 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 571 transitions. [2021-10-05 21:11:50,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 571 transitions. [2021-10-05 21:11:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:50,494 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:50,494 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:50,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2021-10-05 21:11:50,495 INFO L402 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1451080999, now seen corresponding path program 230 times [2021-10-05 21:11:50,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:50,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465897939] [2021-10-05 21:11:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:50,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:50,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:50,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465897939] [2021-10-05 21:11:50,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465897939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:50,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:50,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:50,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388404367] [2021-10-05 21:11:50,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:50,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:50,613 INFO L87 Difference]: Start difference. First operand 262 states and 571 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:50,858 INFO L93 Difference]: Finished difference Result 328 states and 702 transitions. [2021-10-05 21:11:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:50,860 INFO L225 Difference]: With dead ends: 328 [2021-10-05 21:11:50,860 INFO L226 Difference]: Without dead ends: 302 [2021-10-05 21:11:50,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 126.3ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-05 21:11:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 250. [2021-10-05 21:11:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.21285140562249) internal successors, (551), 249 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 551 transitions. [2021-10-05 21:11:50,866 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 551 transitions. Word has length 38 [2021-10-05 21:11:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:50,867 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 551 transitions. [2021-10-05 21:11:50,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 551 transitions. [2021-10-05 21:11:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:50,868 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:50,868 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:50,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-10-05 21:11:50,869 INFO L402 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1151184825, now seen corresponding path program 231 times [2021-10-05 21:11:50,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:50,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590412104] [2021-10-05 21:11:50,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:50,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:50,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:50,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590412104] [2021-10-05 21:11:50,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590412104] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:50,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:50,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:50,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147287661] [2021-10-05 21:11:50,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:50,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:50,994 INFO L87 Difference]: Start difference. First operand 250 states and 551 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:51,305 INFO L93 Difference]: Finished difference Result 274 states and 589 transitions. [2021-10-05 21:11:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:51,306 INFO L225 Difference]: With dead ends: 274 [2021-10-05 21:11:51,306 INFO L226 Difference]: Without dead ends: 246 [2021-10-05 21:11:51,307 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 175.2ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-05 21:11:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-10-05 21:11:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.205761316872428) internal successors, (536), 243 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 536 transitions. [2021-10-05 21:11:51,310 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 536 transitions. Word has length 38 [2021-10-05 21:11:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:51,310 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 536 transitions. [2021-10-05 21:11:51,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 536 transitions. [2021-10-05 21:11:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:51,310 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:51,310 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:51,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2021-10-05 21:11:51,311 INFO L402 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1493233475, now seen corresponding path program 232 times [2021-10-05 21:11:51,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:51,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952943574] [2021-10-05 21:11:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:51,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:51,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:51,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952943574] [2021-10-05 21:11:51,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952943574] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:51,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:51,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:51,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863484115] [2021-10-05 21:11:51,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:51,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:51,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:51,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:51,447 INFO L87 Difference]: Start difference. First operand 244 states and 536 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:51,794 INFO L93 Difference]: Finished difference Result 274 states and 589 transitions. [2021-10-05 21:11:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:51,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:51,795 INFO L225 Difference]: With dead ends: 274 [2021-10-05 21:11:51,795 INFO L226 Difference]: Without dead ends: 252 [2021-10-05 21:11:51,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 213.5ms TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-05 21:11:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2021-10-05 21:11:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.2) internal successors, (539), 245 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 539 transitions. [2021-10-05 21:11:51,800 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 539 transitions. Word has length 38 [2021-10-05 21:11:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:51,800 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 539 transitions. [2021-10-05 21:11:51,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 539 transitions. [2021-10-05 21:11:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:51,801 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:51,801 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:51,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2021-10-05 21:11:51,801 INFO L402 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:51,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash 787497027, now seen corresponding path program 233 times [2021-10-05 21:11:51,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:51,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039714167] [2021-10-05 21:11:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:51,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:51,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:51,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039714167] [2021-10-05 21:11:51,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039714167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:51,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:51,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:51,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739529426] [2021-10-05 21:11:51,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:51,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:51,921 INFO L87 Difference]: Start difference. First operand 246 states and 539 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:52,285 INFO L93 Difference]: Finished difference Result 306 states and 659 transitions. [2021-10-05 21:11:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:52,287 INFO L225 Difference]: With dead ends: 306 [2021-10-05 21:11:52,287 INFO L226 Difference]: Without dead ends: 286 [2021-10-05 21:11:52,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 184.6ms TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-10-05 21:11:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 252. [2021-10-05 21:11:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.183266932270916) internal successors, (548), 251 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 548 transitions. [2021-10-05 21:11:52,290 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 548 transitions. Word has length 38 [2021-10-05 21:11:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:52,291 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 548 transitions. [2021-10-05 21:11:52,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 548 transitions. [2021-10-05 21:11:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:52,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:52,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:52,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-10-05 21:11:52,291 INFO L402 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash -97440127, now seen corresponding path program 234 times [2021-10-05 21:11:52,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:52,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713255342] [2021-10-05 21:11:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:52,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:52,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:52,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713255342] [2021-10-05 21:11:52,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713255342] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:52,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:52,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:52,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928936030] [2021-10-05 21:11:52,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:52,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:52,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:52,422 INFO L87 Difference]: Start difference. First operand 252 states and 548 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:52,759 INFO L93 Difference]: Finished difference Result 328 states and 706 transitions. [2021-10-05 21:11:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:52,760 INFO L225 Difference]: With dead ends: 328 [2021-10-05 21:11:52,760 INFO L226 Difference]: Without dead ends: 310 [2021-10-05 21:11:52,761 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 187.4ms TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-05 21:11:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 254. [2021-10-05 21:11:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.177865612648221) internal successors, (551), 253 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 551 transitions. [2021-10-05 21:11:52,764 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 551 transitions. Word has length 38 [2021-10-05 21:11:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:52,764 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 551 transitions. [2021-10-05 21:11:52,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 551 transitions. [2021-10-05 21:11:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:52,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:52,765 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:52,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2021-10-05 21:11:52,765 INFO L402 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:52,766 INFO L82 PathProgramCache]: Analyzing trace with hash -843442489, now seen corresponding path program 235 times [2021-10-05 21:11:52,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:52,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196191670] [2021-10-05 21:11:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:52,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:52,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:52,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196191670] [2021-10-05 21:11:52,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196191670] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:52,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:52,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:52,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148372181] [2021-10-05 21:11:52,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:52,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:52,886 INFO L87 Difference]: Start difference. First operand 254 states and 551 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:53,204 INFO L93 Difference]: Finished difference Result 298 states and 639 transitions. [2021-10-05 21:11:53,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:53,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:53,206 INFO L225 Difference]: With dead ends: 298 [2021-10-05 21:11:53,206 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 21:11:53,206 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 174.4ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 21:11:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2021-10-05 21:11:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.1991341991341993) internal successors, (508), 231 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 508 transitions. [2021-10-05 21:11:53,209 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 508 transitions. Word has length 38 [2021-10-05 21:11:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:53,209 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 508 transitions. [2021-10-05 21:11:53,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 508 transitions. [2021-10-05 21:11:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:53,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:53,210 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:53,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2021-10-05 21:11:53,210 INFO L402 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash -151435657, now seen corresponding path program 236 times [2021-10-05 21:11:53,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:53,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075843826] [2021-10-05 21:11:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:53,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:53,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:53,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075843826] [2021-10-05 21:11:53,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075843826] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:53,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:53,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:53,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514702148] [2021-10-05 21:11:53,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:53,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:53,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:53,338 INFO L87 Difference]: Start difference. First operand 232 states and 508 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:53,609 INFO L93 Difference]: Finished difference Result 276 states and 592 transitions. [2021-10-05 21:11:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:53,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:53,611 INFO L225 Difference]: With dead ends: 276 [2021-10-05 21:11:53,611 INFO L226 Difference]: Without dead ends: 264 [2021-10-05 21:11:53,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 139.5ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-05 21:11:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2021-10-05 21:11:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 2.1841004184100417) internal successors, (522), 239 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 522 transitions. [2021-10-05 21:11:53,614 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 522 transitions. Word has length 38 [2021-10-05 21:11:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:53,614 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 522 transitions. [2021-10-05 21:11:53,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 522 transitions. [2021-10-05 21:11:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:53,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:53,615 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:53,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-10-05 21:11:53,615 INFO L402 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1245302793, now seen corresponding path program 237 times [2021-10-05 21:11:53,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:53,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860382168] [2021-10-05 21:11:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:53,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:53,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:53,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860382168] [2021-10-05 21:11:53,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860382168] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:53,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:53,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:53,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308203034] [2021-10-05 21:11:53,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:53,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:53,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:53,739 INFO L87 Difference]: Start difference. First operand 240 states and 522 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:53,994 INFO L93 Difference]: Finished difference Result 268 states and 574 transitions. [2021-10-05 21:11:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:53,995 INFO L225 Difference]: With dead ends: 268 [2021-10-05 21:11:53,995 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 21:11:53,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 132.1ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 21:11:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 242. [2021-10-05 21:11:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.1784232365145226) internal successors, (525), 241 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 525 transitions. [2021-10-05 21:11:53,999 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 525 transitions. Word has length 38 [2021-10-05 21:11:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:53,999 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 525 transitions. [2021-10-05 21:11:53,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 525 transitions. [2021-10-05 21:11:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:53,999 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:54,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:54,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2021-10-05 21:11:54,000 INFO L402 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1787029165, now seen corresponding path program 238 times [2021-10-05 21:11:54,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:54,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754216370] [2021-10-05 21:11:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:54,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:54,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:54,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754216370] [2021-10-05 21:11:54,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754216370] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:54,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:54,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:54,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466260486] [2021-10-05 21:11:54,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:54,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:54,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:54,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:54,124 INFO L87 Difference]: Start difference. First operand 242 states and 525 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:54,396 INFO L93 Difference]: Finished difference Result 324 states and 694 transitions. [2021-10-05 21:11:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:54,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:54,397 INFO L225 Difference]: With dead ends: 324 [2021-10-05 21:11:54,397 INFO L226 Difference]: Without dead ends: 308 [2021-10-05 21:11:54,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 125.9ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-10-05 21:11:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 234. [2021-10-05 21:11:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.1931330472103006) internal successors, (511), 233 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 511 transitions. [2021-10-05 21:11:54,401 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 511 transitions. Word has length 38 [2021-10-05 21:11:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:54,401 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 511 transitions. [2021-10-05 21:11:54,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 511 transitions. [2021-10-05 21:11:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:54,402 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:54,402 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:54,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2021-10-05 21:11:54,402 INFO L402 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1839450267, now seen corresponding path program 239 times [2021-10-05 21:11:54,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:54,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419467735] [2021-10-05 21:11:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:54,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:54,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:54,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419467735] [2021-10-05 21:11:54,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419467735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:54,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:54,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:54,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537908677] [2021-10-05 21:11:54,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:54,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:54,530 INFO L87 Difference]: Start difference. First operand 234 states and 511 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:54,801 INFO L93 Difference]: Finished difference Result 268 states and 570 transitions. [2021-10-05 21:11:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:11:54,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:54,802 INFO L225 Difference]: With dead ends: 268 [2021-10-05 21:11:54,802 INFO L226 Difference]: Without dead ends: 252 [2021-10-05 21:11:54,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 139.6ms TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:11:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-05 21:11:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2021-10-05 21:11:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.1904761904761907) internal successors, (506), 231 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 506 transitions. [2021-10-05 21:11:54,806 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 506 transitions. Word has length 38 [2021-10-05 21:11:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:54,806 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 506 transitions. [2021-10-05 21:11:54,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 506 transitions. [2021-10-05 21:11:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:54,806 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:54,807 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:54,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-10-05 21:11:54,807 INFO L402 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 379960059, now seen corresponding path program 240 times [2021-10-05 21:11:54,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:54,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533134838] [2021-10-05 21:11:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:54,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:54,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:54,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533134838] [2021-10-05 21:11:54,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533134838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:54,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:54,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:54,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867214975] [2021-10-05 21:11:54,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:54,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:54,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:54,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:54,934 INFO L87 Difference]: Start difference. First operand 232 states and 506 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:55,128 INFO L93 Difference]: Finished difference Result 256 states and 540 transitions. [2021-10-05 21:11:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:11:55,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:55,130 INFO L225 Difference]: With dead ends: 256 [2021-10-05 21:11:55,130 INFO L226 Difference]: Without dead ends: 230 [2021-10-05 21:11:55,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 109.7ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-05 21:11:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2021-10-05 21:11:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.1644444444444444) internal successors, (487), 225 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 487 transitions. [2021-10-05 21:11:55,134 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 487 transitions. Word has length 38 [2021-10-05 21:11:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:55,134 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 487 transitions. [2021-10-05 21:11:55,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 487 transitions. [2021-10-05 21:11:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:55,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:55,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:55,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-10-05 21:11:55,135 INFO L402 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 119289125, now seen corresponding path program 241 times [2021-10-05 21:11:55,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:55,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066005722] [2021-10-05 21:11:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:55,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:55,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:55,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066005722] [2021-10-05 21:11:55,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066005722] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:55,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:55,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:55,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353708724] [2021-10-05 21:11:55,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:55,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:55,237 INFO L87 Difference]: Start difference. First operand 226 states and 487 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:55,493 INFO L93 Difference]: Finished difference Result 292 states and 618 transitions. [2021-10-05 21:11:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:55,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:55,494 INFO L225 Difference]: With dead ends: 292 [2021-10-05 21:11:55,494 INFO L226 Difference]: Without dead ends: 280 [2021-10-05 21:11:55,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 115.9ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-10-05 21:11:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 236. [2021-10-05 21:11:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.1617021276595745) internal successors, (508), 235 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 508 transitions. [2021-10-05 21:11:55,498 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 508 transitions. Word has length 38 [2021-10-05 21:11:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:55,498 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 508 transitions. [2021-10-05 21:11:55,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 508 transitions. [2021-10-05 21:11:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:55,498 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:55,499 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:55,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-10-05 21:11:55,499 INFO L402 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1516027575, now seen corresponding path program 242 times [2021-10-05 21:11:55,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:55,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223842136] [2021-10-05 21:11:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:55,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:55,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:55,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223842136] [2021-10-05 21:11:55,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223842136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:55,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:55,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:55,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084918027] [2021-10-05 21:11:55,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:55,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:55,623 INFO L87 Difference]: Start difference. First operand 236 states and 508 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:55,905 INFO L93 Difference]: Finished difference Result 268 states and 568 transitions. [2021-10-05 21:11:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:55,907 INFO L225 Difference]: With dead ends: 268 [2021-10-05 21:11:55,907 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 21:11:55,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 167.4ms TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 21:11:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2021-10-05 21:11:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.1561181434599157) internal successors, (511), 237 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 511 transitions. [2021-10-05 21:11:55,910 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 511 transitions. Word has length 38 [2021-10-05 21:11:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:55,910 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 511 transitions. [2021-10-05 21:11:55,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 511 transitions. [2021-10-05 21:11:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:55,911 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:55,911 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:55,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-10-05 21:11:55,911 INFO L402 AbstractCegarLoop]: === Iteration 244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1516304383, now seen corresponding path program 243 times [2021-10-05 21:11:55,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:55,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700559221] [2021-10-05 21:11:55,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:55,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:56,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:56,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700559221] [2021-10-05 21:11:56,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700559221] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:56,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:56,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:56,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916716337] [2021-10-05 21:11:56,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:56,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:56,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:56,031 INFO L87 Difference]: Start difference. First operand 238 states and 511 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:56,342 INFO L93 Difference]: Finished difference Result 380 states and 816 transitions. [2021-10-05 21:11:56,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:56,344 INFO L225 Difference]: With dead ends: 380 [2021-10-05 21:11:56,344 INFO L226 Difference]: Without dead ends: 364 [2021-10-05 21:11:56,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 163.4ms TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-10-05 21:11:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 244. [2021-10-05 21:11:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.205761316872428) internal successors, (536), 243 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 536 transitions. [2021-10-05 21:11:56,347 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 536 transitions. Word has length 38 [2021-10-05 21:11:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:56,348 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 536 transitions. [2021-10-05 21:11:56,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 536 transitions. [2021-10-05 21:11:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:56,348 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:56,348 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:56,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2021-10-05 21:11:56,349 INFO L402 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2110175049, now seen corresponding path program 244 times [2021-10-05 21:11:56,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:56,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122468564] [2021-10-05 21:11:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:56,349 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:56,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-10-05 21:11:56,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:56,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122468564] [2021-10-05 21:11:56,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122468564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:56,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:56,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:56,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442500266] [2021-10-05 21:11:56,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:56,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:56,448 INFO L87 Difference]: Start difference. First operand 244 states and 536 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:56,652 INFO L93 Difference]: Finished difference Result 282 states and 603 transitions. [2021-10-05 21:11:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:56,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:56,654 INFO L225 Difference]: With dead ends: 282 [2021-10-05 21:11:56,654 INFO L226 Difference]: Without dead ends: 266 [2021-10-05 21:11:56,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 116.1ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-05 21:11:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2021-10-05 21:11:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.203319502074689) internal successors, (531), 241 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 531 transitions. [2021-10-05 21:11:56,657 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 531 transitions. Word has length 38 [2021-10-05 21:11:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:56,657 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 531 transitions. [2021-10-05 21:11:56,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 531 transitions. [2021-10-05 21:11:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:56,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:56,658 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:56,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-10-05 21:11:56,658 INFO L402 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash -410547425, now seen corresponding path program 245 times [2021-10-05 21:11:56,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:56,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454505004] [2021-10-05 21:11:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:56,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:56,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:56,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454505004] [2021-10-05 21:11:56,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454505004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:56,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:56,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:56,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464335146] [2021-10-05 21:11:56,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:56,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:56,751 INFO L87 Difference]: Start difference. First operand 242 states and 531 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:56,991 INFO L93 Difference]: Finished difference Result 296 states and 634 transitions. [2021-10-05 21:11:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:56,993 INFO L225 Difference]: With dead ends: 296 [2021-10-05 21:11:56,993 INFO L226 Difference]: Without dead ends: 284 [2021-10-05 21:11:56,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 109.6ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:11:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-05 21:11:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 242. [2021-10-05 21:11:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.1784232365145226) internal successors, (525), 241 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 525 transitions. [2021-10-05 21:11:56,996 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 525 transitions. Word has length 38 [2021-10-05 21:11:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:56,996 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 525 transitions. [2021-10-05 21:11:56,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 525 transitions. [2021-10-05 21:11:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:56,997 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:56,997 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:56,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2021-10-05 21:11:56,997 INFO L402 AbstractCegarLoop]: === Iteration 247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash 986191025, now seen corresponding path program 246 times [2021-10-05 21:11:56,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:56,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278805165] [2021-10-05 21:11:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:56,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:57,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:57,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278805165] [2021-10-05 21:11:57,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278805165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:57,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:57,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:57,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753631516] [2021-10-05 21:11:57,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:57,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:57,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:57,117 INFO L87 Difference]: Start difference. First operand 242 states and 525 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:57,443 INFO L93 Difference]: Finished difference Result 356 states and 756 transitions. [2021-10-05 21:11:57,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:11:57,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:57,445 INFO L225 Difference]: With dead ends: 356 [2021-10-05 21:11:57,445 INFO L226 Difference]: Without dead ends: 342 [2021-10-05 21:11:57,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 161.9ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-10-05 21:11:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 234. [2021-10-05 21:11:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.1759656652360513) internal successors, (507), 233 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 507 transitions. [2021-10-05 21:11:57,449 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 507 transitions. Word has length 38 [2021-10-05 21:11:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:57,449 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 507 transitions. [2021-10-05 21:11:57,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 507 transitions. [2021-10-05 21:11:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:57,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:57,450 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:57,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-10-05 21:11:57,450 INFO L402 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:57,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1147605001, now seen corresponding path program 247 times [2021-10-05 21:11:57,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:57,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496395577] [2021-10-05 21:11:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:57,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:57,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:57,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496395577] [2021-10-05 21:11:57,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496395577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:57,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:57,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:57,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220484531] [2021-10-05 21:11:57,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:57,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:57,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:57,546 INFO L87 Difference]: Start difference. First operand 234 states and 507 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:57,834 INFO L93 Difference]: Finished difference Result 296 states and 626 transitions. [2021-10-05 21:11:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:57,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:57,836 INFO L225 Difference]: With dead ends: 296 [2021-10-05 21:11:57,836 INFO L226 Difference]: Without dead ends: 276 [2021-10-05 21:11:57,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 132.5ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:11:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-10-05 21:11:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 240. [2021-10-05 21:11:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 2.1589958158995817) internal successors, (516), 239 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 516 transitions. [2021-10-05 21:11:57,839 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 516 transitions. Word has length 38 [2021-10-05 21:11:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:57,839 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 516 transitions. [2021-10-05 21:11:57,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 516 transitions. [2021-10-05 21:11:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:57,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:57,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:57,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2021-10-05 21:11:57,841 INFO L402 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 411384369, now seen corresponding path program 248 times [2021-10-05 21:11:57,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:57,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151284892] [2021-10-05 21:11:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:57,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:57,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:57,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151284892] [2021-10-05 21:11:57,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151284892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:57,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:57,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:11:57,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840414741] [2021-10-05 21:11:57,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:11:57,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:57,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:11:57,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:11:57,969 INFO L87 Difference]: Start difference. First operand 240 states and 516 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:58,329 INFO L93 Difference]: Finished difference Result 334 states and 701 transitions. [2021-10-05 21:11:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:11:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:58,330 INFO L225 Difference]: With dead ends: 334 [2021-10-05 21:11:58,330 INFO L226 Difference]: Without dead ends: 294 [2021-10-05 21:11:58,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 192.4ms TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:11:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-10-05 21:11:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2021-10-05 21:11:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.1502145922746783) internal successors, (501), 233 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 501 transitions. [2021-10-05 21:11:58,334 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 501 transitions. Word has length 38 [2021-10-05 21:11:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:58,334 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 501 transitions. [2021-10-05 21:11:58,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 501 transitions. [2021-10-05 21:11:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:58,335 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:58,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:58,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2021-10-05 21:11:58,335 INFO L402 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash -361812087, now seen corresponding path program 249 times [2021-10-05 21:11:58,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:58,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131784528] [2021-10-05 21:11:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:58,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:58,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:58,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131784528] [2021-10-05 21:11:58,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131784528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:58,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:58,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:58,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711568982] [2021-10-05 21:11:58,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:58,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:58,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:58,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:58,459 INFO L87 Difference]: Start difference. First operand 234 states and 501 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:58,736 INFO L93 Difference]: Finished difference Result 304 states and 644 transitions. [2021-10-05 21:11:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:58,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:58,737 INFO L225 Difference]: With dead ends: 304 [2021-10-05 21:11:58,737 INFO L226 Difference]: Without dead ends: 292 [2021-10-05 21:11:58,738 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 161.6ms TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:11:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-10-05 21:11:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 236. [2021-10-05 21:11:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.1531914893617023) internal successors, (506), 235 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 506 transitions. [2021-10-05 21:11:58,741 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 506 transitions. Word has length 38 [2021-10-05 21:11:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:58,741 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 506 transitions. [2021-10-05 21:11:58,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 506 transitions. [2021-10-05 21:11:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:58,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:58,742 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:58,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2021-10-05 21:11:58,742 INFO L402 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash 760603359, now seen corresponding path program 250 times [2021-10-05 21:11:58,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:58,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106548362] [2021-10-05 21:11:58,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:58,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:58,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:58,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106548362] [2021-10-05 21:11:58,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106548362] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:58,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:58,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:58,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527045949] [2021-10-05 21:11:58,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:58,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:58,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:58,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:58,839 INFO L87 Difference]: Start difference. First operand 236 states and 506 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:59,124 INFO L93 Difference]: Finished difference Result 312 states and 654 transitions. [2021-10-05 21:11:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:11:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:59,126 INFO L225 Difference]: With dead ends: 312 [2021-10-05 21:11:59,126 INFO L226 Difference]: Without dead ends: 290 [2021-10-05 21:11:59,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 147.3ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:11:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-05 21:11:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 236. [2021-10-05 21:11:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.1446808510638298) internal successors, (504), 235 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 504 transitions. [2021-10-05 21:11:59,130 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 504 transitions. Word has length 38 [2021-10-05 21:11:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:59,130 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 504 transitions. [2021-10-05 21:11:59,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 504 transitions. [2021-10-05 21:11:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:59,130 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:59,131 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:59,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2021-10-05 21:11:59,131 INFO L402 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:59,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:59,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1784738785, now seen corresponding path program 251 times [2021-10-05 21:11:59,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:59,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132827348] [2021-10-05 21:11:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:59,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:59,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:59,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132827348] [2021-10-05 21:11:59,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132827348] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:59,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:59,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:11:59,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644632024] [2021-10-05 21:11:59,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:11:59,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:59,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:11:59,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:11:59,248 INFO L87 Difference]: Start difference. First operand 236 states and 504 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:59,458 INFO L93 Difference]: Finished difference Result 326 states and 691 transitions. [2021-10-05 21:11:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:11:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:59,459 INFO L225 Difference]: With dead ends: 326 [2021-10-05 21:11:59,459 INFO L226 Difference]: Without dead ends: 318 [2021-10-05 21:11:59,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 114.9ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:11:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-10-05 21:11:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 238. [2021-10-05 21:11:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.1392405063291138) internal successors, (507), 237 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 507 transitions. [2021-10-05 21:11:59,465 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 507 transitions. Word has length 38 [2021-10-05 21:11:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:59,465 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 507 transitions. [2021-10-05 21:11:59,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 507 transitions. [2021-10-05 21:11:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:59,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:59,466 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:59,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-10-05 21:11:59,467 INFO L402 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1609984503, now seen corresponding path program 252 times [2021-10-05 21:11:59,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:59,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808052245] [2021-10-05 21:11:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:59,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:11:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:11:59,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:11:59,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808052245] [2021-10-05 21:11:59,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808052245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:11:59,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:11:59,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:11:59,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359033707] [2021-10-05 21:11:59,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:11:59,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:11:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:11:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:11:59,584 INFO L87 Difference]: Start difference. First operand 238 states and 507 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:11:59,863 INFO L93 Difference]: Finished difference Result 338 states and 709 transitions. [2021-10-05 21:11:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:11:59,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:11:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:11:59,865 INFO L225 Difference]: With dead ends: 338 [2021-10-05 21:11:59,865 INFO L226 Difference]: Without dead ends: 310 [2021-10-05 21:11:59,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 133.3ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:11:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-05 21:11:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 228. [2021-10-05 21:11:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.158590308370044) internal successors, (490), 227 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 490 transitions. [2021-10-05 21:11:59,871 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 490 transitions. Word has length 38 [2021-10-05 21:11:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:11:59,871 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 490 transitions. [2021-10-05 21:11:59,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:11:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 490 transitions. [2021-10-05 21:11:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:11:59,873 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:11:59,873 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:11:59,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2021-10-05 21:11:59,873 INFO L402 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:11:59,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:11:59,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1126707297, now seen corresponding path program 253 times [2021-10-05 21:11:59,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:11:59,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085818016] [2021-10-05 21:11:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:11:59,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:11:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:00,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:00,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085818016] [2021-10-05 21:12:00,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085818016] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:00,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:00,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:00,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938909947] [2021-10-05 21:12:00,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:00,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:00,038 INFO L87 Difference]: Start difference. First operand 228 states and 490 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:00,348 INFO L93 Difference]: Finished difference Result 266 states and 553 transitions. [2021-10-05 21:12:00,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:12:00,348 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:00,349 INFO L225 Difference]: With dead ends: 266 [2021-10-05 21:12:00,349 INFO L226 Difference]: Without dead ends: 244 [2021-10-05 21:12:00,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 204.3ms TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:12:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-10-05 21:12:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 230. [2021-10-05 21:12:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.1528384279475983) internal successors, (493), 229 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 493 transitions. [2021-10-05 21:12:00,352 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 493 transitions. Word has length 38 [2021-10-05 21:12:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:00,352 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 493 transitions. [2021-10-05 21:12:00,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 493 transitions. [2021-10-05 21:12:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:00,354 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:00,354 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:00,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2021-10-05 21:12:00,354 INFO L402 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:00,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1559440795, now seen corresponding path program 254 times [2021-10-05 21:12:00,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:00,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235812794] [2021-10-05 21:12:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:00,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:00,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:00,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235812794] [2021-10-05 21:12:00,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235812794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:00,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:00,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:00,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656417796] [2021-10-05 21:12:00,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:00,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:00,495 INFO L87 Difference]: Start difference. First operand 230 states and 493 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:00,840 INFO L93 Difference]: Finished difference Result 282 states and 583 transitions. [2021-10-05 21:12:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:12:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:00,841 INFO L225 Difference]: With dead ends: 282 [2021-10-05 21:12:00,841 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 21:12:00,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 211.1ms TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:12:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 21:12:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2021-10-05 21:12:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.1361702127659576) internal successors, (502), 235 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 502 transitions. [2021-10-05 21:12:00,845 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 502 transitions. Word has length 38 [2021-10-05 21:12:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:00,846 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 502 transitions. [2021-10-05 21:12:00,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 502 transitions. [2021-10-05 21:12:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:00,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:00,847 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:00,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2021-10-05 21:12:00,847 INFO L402 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1999305869, now seen corresponding path program 255 times [2021-10-05 21:12:00,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:00,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165738533] [2021-10-05 21:12:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:00,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:00,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:00,983 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165738533] [2021-10-05 21:12:00,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165738533] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:00,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:00,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:00,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880107071] [2021-10-05 21:12:00,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:00,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:00,986 INFO L87 Difference]: Start difference. First operand 236 states and 502 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:01,311 INFO L93 Difference]: Finished difference Result 266 states and 553 transitions. [2021-10-05 21:12:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:01,314 INFO L225 Difference]: With dead ends: 266 [2021-10-05 21:12:01,315 INFO L226 Difference]: Without dead ends: 252 [2021-10-05 21:12:01,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 193.1ms TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-10-05 21:12:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 238. [2021-10-05 21:12:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.130801687763713) internal successors, (505), 237 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 505 transitions. [2021-10-05 21:12:01,320 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 505 transitions. Word has length 38 [2021-10-05 21:12:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:01,321 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 505 transitions. [2021-10-05 21:12:01,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 505 transitions. [2021-10-05 21:12:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:01,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:01,322 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:01,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2021-10-05 21:12:01,323 INFO L402 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash -858271807, now seen corresponding path program 256 times [2021-10-05 21:12:01,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:01,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508625840] [2021-10-05 21:12:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:01,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:01,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:01,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508625840] [2021-10-05 21:12:01,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508625840] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:01,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:01,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:01,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415575699] [2021-10-05 21:12:01,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:01,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:01,474 INFO L87 Difference]: Start difference. First operand 238 states and 505 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:01,810 INFO L93 Difference]: Finished difference Result 320 states and 660 transitions. [2021-10-05 21:12:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:12:01,811 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:01,812 INFO L225 Difference]: With dead ends: 320 [2021-10-05 21:12:01,812 INFO L226 Difference]: Without dead ends: 290 [2021-10-05 21:12:01,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 210.4ms TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:12:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-05 21:12:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2021-10-05 21:12:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.1555555555555554) internal successors, (485), 225 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 485 transitions. [2021-10-05 21:12:01,817 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 485 transitions. Word has length 38 [2021-10-05 21:12:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:01,817 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 485 transitions. [2021-10-05 21:12:01,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 485 transitions. [2021-10-05 21:12:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:01,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:01,817 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:01,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-10-05 21:12:01,818 INFO L402 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1643838647, now seen corresponding path program 257 times [2021-10-05 21:12:01,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:01,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570624994] [2021-10-05 21:12:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:01,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:01,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-10-05 21:12:01,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:01,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570624994] [2021-10-05 21:12:01,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570624994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:01,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:01,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:01,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393352545] [2021-10-05 21:12:01,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:01,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:01,966 INFO L87 Difference]: Start difference. First operand 226 states and 485 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:02,270 INFO L93 Difference]: Finished difference Result 250 states and 523 transitions. [2021-10-05 21:12:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:02,272 INFO L225 Difference]: With dead ends: 250 [2021-10-05 21:12:02,272 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 21:12:02,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 214.6ms TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 21:12:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2021-10-05 21:12:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.146118721461187) internal successors, (470), 219 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 470 transitions. [2021-10-05 21:12:02,276 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 470 transitions. Word has length 38 [2021-10-05 21:12:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:02,276 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 470 transitions. [2021-10-05 21:12:02,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 470 transitions. [2021-10-05 21:12:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:02,277 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:02,277 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:02,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2021-10-05 21:12:02,277 INFO L402 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 873736511, now seen corresponding path program 258 times [2021-10-05 21:12:02,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:02,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309705833] [2021-10-05 21:12:02,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:02,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:02,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:02,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309705833] [2021-10-05 21:12:02,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309705833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:02,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:02,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:02,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086131536] [2021-10-05 21:12:02,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:02,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:02,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:02,413 INFO L87 Difference]: Start difference. First operand 220 states and 470 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:02,735 INFO L93 Difference]: Finished difference Result 244 states and 510 transitions. [2021-10-05 21:12:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:02,737 INFO L225 Difference]: With dead ends: 244 [2021-10-05 21:12:02,737 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 21:12:02,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 198.8ms TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 21:12:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-10-05 21:12:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.1402714932126696) internal successors, (473), 221 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 473 transitions. [2021-10-05 21:12:02,740 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 473 transitions. Word has length 38 [2021-10-05 21:12:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:02,740 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 473 transitions. [2021-10-05 21:12:02,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 473 transitions. [2021-10-05 21:12:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:02,741 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:02,741 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:02,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2021-10-05 21:12:02,741 INFO L402 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 441003013, now seen corresponding path program 259 times [2021-10-05 21:12:02,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:02,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406502199] [2021-10-05 21:12:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:02,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:02,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:02,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406502199] [2021-10-05 21:12:02,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406502199] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:02,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:02,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:02,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59760006] [2021-10-05 21:12:02,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:02,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:02,875 INFO L87 Difference]: Start difference. First operand 222 states and 473 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:03,176 INFO L93 Difference]: Finished difference Result 252 states and 528 transitions. [2021-10-05 21:12:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:03,177 INFO L225 Difference]: With dead ends: 252 [2021-10-05 21:12:03,177 INFO L226 Difference]: Without dead ends: 232 [2021-10-05 21:12:03,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 184.5ms TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-05 21:12:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2021-10-05 21:12:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.1233480176211454) internal successors, (482), 227 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 482 transitions. [2021-10-05 21:12:03,181 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 482 transitions. Word has length 38 [2021-10-05 21:12:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:03,181 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 482 transitions. [2021-10-05 21:12:03,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 482 transitions. [2021-10-05 21:12:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:03,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:03,182 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:03,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2021-10-05 21:12:03,182 INFO L402 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash -295217619, now seen corresponding path program 260 times [2021-10-05 21:12:03,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:03,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587136951] [2021-10-05 21:12:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:03,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:03,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:03,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587136951] [2021-10-05 21:12:03,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587136951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:03,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:03,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:03,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417033473] [2021-10-05 21:12:03,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:03,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:03,311 INFO L87 Difference]: Start difference. First operand 228 states and 482 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:03,561 INFO L93 Difference]: Finished difference Result 244 states and 510 transitions. [2021-10-05 21:12:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:03,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:03,562 INFO L225 Difference]: With dead ends: 244 [2021-10-05 21:12:03,563 INFO L226 Difference]: Without dead ends: 230 [2021-10-05 21:12:03,563 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 160.9ms TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:12:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-05 21:12:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-05 21:12:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.1179039301310043) internal successors, (485), 229 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 485 transitions. [2021-10-05 21:12:03,566 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 485 transitions. Word has length 38 [2021-10-05 21:12:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:03,566 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 485 transitions. [2021-10-05 21:12:03,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 485 transitions. [2021-10-05 21:12:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:03,567 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:03,567 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:03,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2021-10-05 21:12:03,567 INFO L402 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1142172001, now seen corresponding path program 261 times [2021-10-05 21:12:03,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:03,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694313535] [2021-10-05 21:12:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:03,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:03,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:03,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694313535] [2021-10-05 21:12:03,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694313535] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:03,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:03,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:03,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267262130] [2021-10-05 21:12:03,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:03,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:03,689 INFO L87 Difference]: Start difference. First operand 230 states and 485 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:03,928 INFO L93 Difference]: Finished difference Result 248 states and 518 transitions. [2021-10-05 21:12:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:03,930 INFO L225 Difference]: With dead ends: 248 [2021-10-05 21:12:03,930 INFO L226 Difference]: Without dead ends: 208 [2021-10-05 21:12:03,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 151.6ms TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:12:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-05 21:12:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2021-10-05 21:12:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.135265700483092) internal successors, (442), 207 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 442 transitions. [2021-10-05 21:12:03,933 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 442 transitions. Word has length 38 [2021-10-05 21:12:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:03,933 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 442 transitions. [2021-10-05 21:12:03,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 442 transitions. [2021-10-05 21:12:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:03,933 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:03,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-10-05 21:12:03,934 INFO L402 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 414476597, now seen corresponding path program 262 times [2021-10-05 21:12:03,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:03,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051433187] [2021-10-05 21:12:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:03,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:04,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:04,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051433187] [2021-10-05 21:12:04,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051433187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:04,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:04,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:04,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923855204] [2021-10-05 21:12:04,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:04,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:04,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:04,042 INFO L87 Difference]: Start difference. First operand 208 states and 442 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:04,321 INFO L93 Difference]: Finished difference Result 278 states and 577 transitions. [2021-10-05 21:12:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:04,322 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:04,323 INFO L225 Difference]: With dead ends: 278 [2021-10-05 21:12:04,323 INFO L226 Difference]: Without dead ends: 266 [2021-10-05 21:12:04,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 155.8ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-10-05 21:12:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 214. [2021-10-05 21:12:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.1173708920187795) internal successors, (451), 213 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 451 transitions. [2021-10-05 21:12:04,326 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 451 transitions. Word has length 38 [2021-10-05 21:12:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:04,327 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 451 transitions. [2021-10-05 21:12:04,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 451 transitions. [2021-10-05 21:12:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:04,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:04,327 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:04,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2021-10-05 21:12:04,327 INFO L402 AbstractCegarLoop]: === Iteration 264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1467946515, now seen corresponding path program 263 times [2021-10-05 21:12:04,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:04,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113044773] [2021-10-05 21:12:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:04,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:04,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:04,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113044773] [2021-10-05 21:12:04,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113044773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:04,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:04,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:04,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048361111] [2021-10-05 21:12:04,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:04,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:04,432 INFO L87 Difference]: Start difference. First operand 214 states and 451 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:04,743 INFO L93 Difference]: Finished difference Result 378 states and 817 transitions. [2021-10-05 21:12:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:04,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:04,744 INFO L225 Difference]: With dead ends: 378 [2021-10-05 21:12:04,744 INFO L226 Difference]: Without dead ends: 370 [2021-10-05 21:12:04,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 147.2ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-10-05 21:12:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 228. [2021-10-05 21:12:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.158590308370044) internal successors, (490), 227 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 490 transitions. [2021-10-05 21:12:04,748 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 490 transitions. Word has length 38 [2021-10-05 21:12:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:04,748 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 490 transitions. [2021-10-05 21:12:04,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 490 transitions. [2021-10-05 21:12:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:04,749 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:04,749 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:04,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2021-10-05 21:12:04,749 INFO L402 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash -746775587, now seen corresponding path program 264 times [2021-10-05 21:12:04,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:04,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571663062] [2021-10-05 21:12:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:04,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:04,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:04,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571663062] [2021-10-05 21:12:04,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571663062] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:04,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:04,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:04,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132877169] [2021-10-05 21:12:04,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:04,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:04,862 INFO L87 Difference]: Start difference. First operand 228 states and 490 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:05,118 INFO L93 Difference]: Finished difference Result 284 states and 596 transitions. [2021-10-05 21:12:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:05,119 INFO L225 Difference]: With dead ends: 284 [2021-10-05 21:12:05,119 INFO L226 Difference]: Without dead ends: 270 [2021-10-05 21:12:05,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 162.3ms TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-05 21:12:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 222. [2021-10-05 21:12:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.167420814479638) internal successors, (479), 221 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 479 transitions. [2021-10-05 21:12:05,122 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 479 transitions. Word has length 38 [2021-10-05 21:12:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:05,123 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 479 transitions. [2021-10-05 21:12:05,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 479 transitions. [2021-10-05 21:12:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:05,123 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:05,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:05,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2021-10-05 21:12:05,123 INFO L402 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:05,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1889604775, now seen corresponding path program 265 times [2021-10-05 21:12:05,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:05,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715528575] [2021-10-05 21:12:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:05,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:05,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:05,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:05,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715528575] [2021-10-05 21:12:05,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715528575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:05,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:05,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:05,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201742865] [2021-10-05 21:12:05,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:05,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:05,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:05,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:05,246 INFO L87 Difference]: Start difference. First operand 222 states and 479 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:05,507 INFO L93 Difference]: Finished difference Result 278 states and 577 transitions. [2021-10-05 21:12:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:05,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:05,509 INFO L225 Difference]: With dead ends: 278 [2021-10-05 21:12:05,509 INFO L226 Difference]: Without dead ends: 262 [2021-10-05 21:12:05,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 165.0ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-05 21:12:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 220. [2021-10-05 21:12:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.164383561643836) internal successors, (474), 219 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 474 transitions. [2021-10-05 21:12:05,514 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 474 transitions. Word has length 38 [2021-10-05 21:12:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:05,514 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 474 transitions. [2021-10-05 21:12:05,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 474 transitions. [2021-10-05 21:12:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:05,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:05,515 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:05,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2021-10-05 21:12:05,516 INFO L402 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash 11483189, now seen corresponding path program 266 times [2021-10-05 21:12:05,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:05,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315596412] [2021-10-05 21:12:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:05,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:05,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:05,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315596412] [2021-10-05 21:12:05,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315596412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:05,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:05,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:05,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376303100] [2021-10-05 21:12:05,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:05,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:05,628 INFO L87 Difference]: Start difference. First operand 220 states and 474 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:05,922 INFO L93 Difference]: Finished difference Result 334 states and 713 transitions. [2021-10-05 21:12:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:05,924 INFO L225 Difference]: With dead ends: 334 [2021-10-05 21:12:05,924 INFO L226 Difference]: Without dead ends: 322 [2021-10-05 21:12:05,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 143.8ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-05 21:12:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 220. [2021-10-05 21:12:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.136986301369863) internal successors, (468), 219 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 468 transitions. [2021-10-05 21:12:05,927 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 468 transitions. Word has length 38 [2021-10-05 21:12:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:05,927 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 468 transitions. [2021-10-05 21:12:05,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 468 transitions. [2021-10-05 21:12:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:05,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:05,928 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:05,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2021-10-05 21:12:05,928 INFO L402 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:05,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:05,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1149768995, now seen corresponding path program 267 times [2021-10-05 21:12:05,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:05,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291769445] [2021-10-05 21:12:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:05,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:06,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:06,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291769445] [2021-10-05 21:12:06,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291769445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:06,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:06,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:06,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485226132] [2021-10-05 21:12:06,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:06,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:06,037 INFO L87 Difference]: Start difference. First operand 220 states and 468 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:06,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:06,329 INFO L93 Difference]: Finished difference Result 394 states and 835 transitions. [2021-10-05 21:12:06,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:06,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:06,330 INFO L225 Difference]: With dead ends: 394 [2021-10-05 21:12:06,330 INFO L226 Difference]: Without dead ends: 380 [2021-10-05 21:12:06,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 162.0ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:12:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-05 21:12:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2021-10-05 21:12:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.132701421800948) internal successors, (450), 211 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 450 transitions. [2021-10-05 21:12:06,333 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 450 transitions. Word has length 38 [2021-10-05 21:12:06,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:06,334 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 450 transitions. [2021-10-05 21:12:06,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 450 transitions. [2021-10-05 21:12:06,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:06,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:06,334 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:06,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2021-10-05 21:12:06,334 INFO L402 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1296632665, now seen corresponding path program 268 times [2021-10-05 21:12:06,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:06,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93121179] [2021-10-05 21:12:06,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:06,335 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:06,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:06,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93121179] [2021-10-05 21:12:06,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93121179] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:06,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:06,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:06,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615620906] [2021-10-05 21:12:06,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:06,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:06,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:06,442 INFO L87 Difference]: Start difference. First operand 212 states and 450 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:06,789 INFO L93 Difference]: Finished difference Result 326 states and 693 transitions. [2021-10-05 21:12:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:12:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:06,790 INFO L225 Difference]: With dead ends: 326 [2021-10-05 21:12:06,791 INFO L226 Difference]: Without dead ends: 306 [2021-10-05 21:12:06,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 179.3ms TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:12:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-05 21:12:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 218. [2021-10-05 21:12:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.1152073732718892) internal successors, (459), 217 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 459 transitions. [2021-10-05 21:12:06,795 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 459 transitions. Word has length 38 [2021-10-05 21:12:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:06,795 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 459 transitions. [2021-10-05 21:12:06,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 459 transitions. [2021-10-05 21:12:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:06,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:06,796 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:06,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2021-10-05 21:12:06,796 INFO L402 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash 411695511, now seen corresponding path program 269 times [2021-10-05 21:12:06,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:06,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441866630] [2021-10-05 21:12:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:06,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:06,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:06,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441866630] [2021-10-05 21:12:06,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441866630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:06,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:06,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:06,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712532965] [2021-10-05 21:12:06,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:06,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:06,912 INFO L87 Difference]: Start difference. First operand 218 states and 459 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:07,181 INFO L93 Difference]: Finished difference Result 350 states and 745 transitions. [2021-10-05 21:12:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:07,182 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:07,183 INFO L225 Difference]: With dead ends: 350 [2021-10-05 21:12:07,183 INFO L226 Difference]: Without dead ends: 332 [2021-10-05 21:12:07,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 155.1ms TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-10-05 21:12:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 220. [2021-10-05 21:12:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.1095890410958904) internal successors, (462), 219 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 462 transitions. [2021-10-05 21:12:07,188 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 462 transitions. Word has length 38 [2021-10-05 21:12:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:07,188 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 462 transitions. [2021-10-05 21:12:07,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 462 transitions. [2021-10-05 21:12:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:07,189 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:07,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:07,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-10-05 21:12:07,189 INFO L402 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -334306851, now seen corresponding path program 270 times [2021-10-05 21:12:07,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:07,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970368201] [2021-10-05 21:12:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:07,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:07,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:07,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:07,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970368201] [2021-10-05 21:12:07,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970368201] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:07,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:07,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:07,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516591086] [2021-10-05 21:12:07,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:07,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:07,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:07,314 INFO L87 Difference]: Start difference. First operand 220 states and 462 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:07,661 INFO L93 Difference]: Finished difference Result 346 states and 733 transitions. [2021-10-05 21:12:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:07,662 INFO L225 Difference]: With dead ends: 346 [2021-10-05 21:12:07,662 INFO L226 Difference]: Without dead ends: 324 [2021-10-05 21:12:07,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 190.9ms TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:12:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-10-05 21:12:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 212. [2021-10-05 21:12:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.104265402843602) internal successors, (444), 211 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 444 transitions. [2021-10-05 21:12:07,668 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 444 transitions. Word has length 38 [2021-10-05 21:12:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:07,668 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 444 transitions. [2021-10-05 21:12:07,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 444 transitions. [2021-10-05 21:12:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:07,669 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:07,669 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:07,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-10-05 21:12:07,669 INFO L402 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 718947893, now seen corresponding path program 271 times [2021-10-05 21:12:07,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:07,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991607784] [2021-10-05 21:12:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:07,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:07,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:07,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991607784] [2021-10-05 21:12:07,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991607784] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:07,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:07,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:07,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830958354] [2021-10-05 21:12:07,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:07,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:07,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:07,780 INFO L87 Difference]: Start difference. First operand 212 states and 444 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:07,994 INFO L93 Difference]: Finished difference Result 282 states and 585 transitions. [2021-10-05 21:12:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:07,995 INFO L225 Difference]: With dead ends: 282 [2021-10-05 21:12:07,996 INFO L226 Difference]: Without dead ends: 274 [2021-10-05 21:12:07,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 129.5ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:12:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-10-05 21:12:07,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 212. [2021-10-05 21:12:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.09478672985782) internal successors, (442), 211 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 442 transitions. [2021-10-05 21:12:07,999 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 442 transitions. Word has length 38 [2021-10-05 21:12:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:08,000 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 442 transitions. [2021-10-05 21:12:08,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 442 transitions. [2021-10-05 21:12:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:08,000 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:08,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:08,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-10-05 21:12:08,000 INFO L402 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2108846113, now seen corresponding path program 272 times [2021-10-05 21:12:08,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:08,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990696962] [2021-10-05 21:12:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:08,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:08,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:08,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990696962] [2021-10-05 21:12:08,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990696962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:08,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:08,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:08,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456804486] [2021-10-05 21:12:08,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:08,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:08,115 INFO L87 Difference]: Start difference. First operand 212 states and 442 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:08,365 INFO L93 Difference]: Finished difference Result 262 states and 539 transitions. [2021-10-05 21:12:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:08,366 INFO L225 Difference]: With dead ends: 262 [2021-10-05 21:12:08,366 INFO L226 Difference]: Without dead ends: 242 [2021-10-05 21:12:08,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 150.3ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-05 21:12:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 210. [2021-10-05 21:12:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.090909090909091) internal successors, (437), 209 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 437 transitions. [2021-10-05 21:12:08,370 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 437 transitions. Word has length 38 [2021-10-05 21:12:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:08,370 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 437 transitions. [2021-10-05 21:12:08,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 437 transitions. [2021-10-05 21:12:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:08,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:08,371 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:08,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-10-05 21:12:08,371 INFO L402 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash -890457367, now seen corresponding path program 273 times [2021-10-05 21:12:08,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:08,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128201682] [2021-10-05 21:12:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:08,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:08,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:08,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128201682] [2021-10-05 21:12:08,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128201682] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:08,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:08,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:08,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565561565] [2021-10-05 21:12:08,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:08,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:08,475 INFO L87 Difference]: Start difference. First operand 210 states and 437 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:08,687 INFO L93 Difference]: Finished difference Result 322 states and 679 transitions. [2021-10-05 21:12:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:08,688 INFO L225 Difference]: With dead ends: 322 [2021-10-05 21:12:08,688 INFO L226 Difference]: Without dead ends: 314 [2021-10-05 21:12:08,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 137.1ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-05 21:12:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 214. [2021-10-05 21:12:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.0892018779342725) internal successors, (445), 213 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 445 transitions. [2021-10-05 21:12:08,691 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 445 transitions. Word has length 38 [2021-10-05 21:12:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:08,691 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 445 transitions. [2021-10-05 21:12:08,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 445 transitions. [2021-10-05 21:12:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:08,692 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:08,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2021-10-05 21:12:08,692 INFO L402 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash -169286439, now seen corresponding path program 274 times [2021-10-05 21:12:08,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:08,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2890199] [2021-10-05 21:12:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:08,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:08,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:08,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2890199] [2021-10-05 21:12:08,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2890199] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:08,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:08,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:08,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073119139] [2021-10-05 21:12:08,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:08,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:08,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:08,797 INFO L87 Difference]: Start difference. First operand 214 states and 445 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:09,086 INFO L93 Difference]: Finished difference Result 320 states and 672 transitions. [2021-10-05 21:12:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:09,088 INFO L225 Difference]: With dead ends: 320 [2021-10-05 21:12:09,088 INFO L226 Difference]: Without dead ends: 312 [2021-10-05 21:12:09,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 157.5ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:12:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-10-05 21:12:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 212. [2021-10-05 21:12:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.085308056872038) internal successors, (440), 211 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 440 transitions. [2021-10-05 21:12:09,091 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 440 transitions. Word has length 38 [2021-10-05 21:12:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:09,091 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 440 transitions. [2021-10-05 21:12:09,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 440 transitions. [2021-10-05 21:12:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:09,092 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:09,092 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:09,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-10-05 21:12:09,092 INFO L402 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1227383825, now seen corresponding path program 275 times [2021-10-05 21:12:09,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:09,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54552247] [2021-10-05 21:12:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:09,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:09,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:09,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54552247] [2021-10-05 21:12:09,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54552247] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:09,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:09,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:09,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358985675] [2021-10-05 21:12:09,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:09,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:09,193 INFO L87 Difference]: Start difference. First operand 212 states and 440 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:09,469 INFO L93 Difference]: Finished difference Result 314 states and 657 transitions. [2021-10-05 21:12:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:09,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:09,470 INFO L225 Difference]: With dead ends: 314 [2021-10-05 21:12:09,470 INFO L226 Difference]: Without dead ends: 296 [2021-10-05 21:12:09,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 157.1ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-10-05 21:12:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 214. [2021-10-05 21:12:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.07981220657277) internal successors, (443), 213 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 443 transitions. [2021-10-05 21:12:09,474 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 443 transitions. Word has length 38 [2021-10-05 21:12:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:09,474 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 443 transitions. [2021-10-05 21:12:09,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 443 transitions. [2021-10-05 21:12:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:09,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:09,475 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:09,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-10-05 21:12:09,475 INFO L402 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:09,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1973386187, now seen corresponding path program 276 times [2021-10-05 21:12:09,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:09,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510941381] [2021-10-05 21:12:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:09,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:09,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:09,595 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510941381] [2021-10-05 21:12:09,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510941381] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:09,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:09,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:09,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965249685] [2021-10-05 21:12:09,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:09,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:09,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:09,597 INFO L87 Difference]: Start difference. First operand 214 states and 443 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:09,910 INFO L93 Difference]: Finished difference Result 310 states and 645 transitions. [2021-10-05 21:12:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:09,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:09,912 INFO L225 Difference]: With dead ends: 310 [2021-10-05 21:12:09,912 INFO L226 Difference]: Without dead ends: 286 [2021-10-05 21:12:09,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 199.9ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:12:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-10-05 21:12:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 204. [2021-10-05 21:12:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.0985221674876846) internal successors, (426), 203 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 426 transitions. [2021-10-05 21:12:09,915 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 426 transitions. Word has length 38 [2021-10-05 21:12:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:09,915 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 426 transitions. [2021-10-05 21:12:09,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 426 transitions. [2021-10-05 21:12:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:09,916 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:09,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-10-05 21:12:09,916 INFO L402 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash -704676683, now seen corresponding path program 277 times [2021-10-05 21:12:09,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:09,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826565513] [2021-10-05 21:12:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:09,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:10,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:10,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826565513] [2021-10-05 21:12:10,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826565513] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:10,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:10,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:10,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211578432] [2021-10-05 21:12:10,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:10,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:10,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:10,053 INFO L87 Difference]: Start difference. First operand 204 states and 426 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:10,366 INFO L93 Difference]: Finished difference Result 224 states and 458 transitions. [2021-10-05 21:12:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:10,367 INFO L225 Difference]: With dead ends: 224 [2021-10-05 21:12:10,367 INFO L226 Difference]: Without dead ends: 202 [2021-10-05 21:12:10,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 210.0ms TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-05 21:12:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-05 21:12:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.0945273631840795) internal successors, (421), 201 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 421 transitions. [2021-10-05 21:12:10,370 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 421 transitions. Word has length 38 [2021-10-05 21:12:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:10,370 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 421 transitions. [2021-10-05 21:12:10,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 421 transitions. [2021-10-05 21:12:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:10,371 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:10,371 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:10,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-10-05 21:12:10,371 INFO L402 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1410413131, now seen corresponding path program 278 times [2021-10-05 21:12:10,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:10,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945356432] [2021-10-05 21:12:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:10,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:10,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:10,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945356432] [2021-10-05 21:12:10,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945356432] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:10,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:10,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:10,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926733152] [2021-10-05 21:12:10,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:10,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:10,500 INFO L87 Difference]: Start difference. First operand 202 states and 421 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:10,809 INFO L93 Difference]: Finished difference Result 256 states and 528 transitions. [2021-10-05 21:12:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:10,809 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:10,810 INFO L225 Difference]: With dead ends: 256 [2021-10-05 21:12:10,810 INFO L226 Difference]: Without dead ends: 236 [2021-10-05 21:12:10,810 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 197.6ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-05 21:12:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 208. [2021-10-05 21:12:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.077294685990338) internal successors, (430), 207 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 430 transitions. [2021-10-05 21:12:10,813 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 430 transitions. Word has length 38 [2021-10-05 21:12:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:10,813 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 430 transitions. [2021-10-05 21:12:10,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 430 transitions. [2021-10-05 21:12:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:10,814 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:10,814 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:10,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2021-10-05 21:12:10,814 INFO L402 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1999617011, now seen corresponding path program 279 times [2021-10-05 21:12:10,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:10,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804299437] [2021-10-05 21:12:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:10,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:10,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:10,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804299437] [2021-10-05 21:12:10,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804299437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:10,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:10,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:10,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407470120] [2021-10-05 21:12:10,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:10,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:10,944 INFO L87 Difference]: Start difference. First operand 208 states and 430 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:11,256 INFO L93 Difference]: Finished difference Result 286 states and 603 transitions. [2021-10-05 21:12:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:11,257 INFO L225 Difference]: With dead ends: 286 [2021-10-05 21:12:11,257 INFO L226 Difference]: Without dead ends: 268 [2021-10-05 21:12:11,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 207.5ms TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-10-05 21:12:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-10-05 21:12:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 210. [2021-10-05 21:12:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.0717703349282295) internal successors, (433), 209 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-10-05 21:12:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 433 transitions. [2021-10-05 21:12:11,260 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 433 transitions. Word has length 38 [2021-10-05 21:12:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:11,260 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 433 transitions. [2021-10-05 21:12:11,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 433 transitions. [2021-10-05 21:12:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:11,261 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:11,261 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:11,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2021-10-05 21:12:11,261 INFO L402 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1253614649, now seen corresponding path program 280 times [2021-10-05 21:12:11,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:11,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301249466] [2021-10-05 21:12:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:11,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:11,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:11,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301249466] [2021-10-05 21:12:11,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301249466] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:11,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:11,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:11,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617983894] [2021-10-05 21:12:11,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:11,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:11,386 INFO L87 Difference]: Start difference. First operand 210 states and 433 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:11,698 INFO L93 Difference]: Finished difference Result 248 states and 508 transitions. [2021-10-05 21:12:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:11,700 INFO L225 Difference]: With dead ends: 248 [2021-10-05 21:12:11,700 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 21:12:11,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 189.4ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 21:12:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2021-10-05 21:12:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.0964467005076144) internal successors, (413), 197 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 413 transitions. [2021-10-05 21:12:11,703 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 413 transitions. Word has length 38 [2021-10-05 21:12:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:11,703 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 413 transitions. [2021-10-05 21:12:11,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 413 transitions. [2021-10-05 21:12:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:11,703 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:11,703 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:11,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2021-10-05 21:12:11,704 INFO L402 AbstractCegarLoop]: === Iteration 282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1576127927, now seen corresponding path program 281 times [2021-10-05 21:12:11,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:11,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250991525] [2021-10-05 21:12:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:11,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:11,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:11,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250991525] [2021-10-05 21:12:11,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250991525] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:11,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:11,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:11,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620195265] [2021-10-05 21:12:11,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:11,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:11,823 INFO L87 Difference]: Start difference. First operand 198 states and 413 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:12,087 INFO L93 Difference]: Finished difference Result 236 states and 484 transitions. [2021-10-05 21:12:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:12,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:12,088 INFO L225 Difference]: With dead ends: 236 [2021-10-05 21:12:12,088 INFO L226 Difference]: Without dead ends: 224 [2021-10-05 21:12:12,088 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 171.0ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-10-05 21:12:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 204. [2021-10-05 21:12:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.0788177339901477) internal successors, (422), 203 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 422 transitions. [2021-10-05 21:12:12,091 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 422 transitions. Word has length 38 [2021-10-05 21:12:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:12,091 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 422 transitions. [2021-10-05 21:12:12,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 422 transitions. [2021-10-05 21:12:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:12,092 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:12,092 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:12,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2021-10-05 21:12:12,092 INFO L402 AbstractCegarLoop]: === Iteration 283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:12,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1322100919, now seen corresponding path program 282 times [2021-10-05 21:12:12,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:12,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790367970] [2021-10-05 21:12:12,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:12,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:12,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:12,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790367970] [2021-10-05 21:12:12,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790367970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:12,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:12,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:12,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836382926] [2021-10-05 21:12:12,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:12,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:12,210 INFO L87 Difference]: Start difference. First operand 204 states and 422 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:12,442 INFO L93 Difference]: Finished difference Result 228 states and 466 transitions. [2021-10-05 21:12:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:12,444 INFO L225 Difference]: With dead ends: 228 [2021-10-05 21:12:12,444 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 21:12:12,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 162.2ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 21:12:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 206. [2021-10-05 21:12:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.073170731707317) internal successors, (425), 205 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 425 transitions. [2021-10-05 21:12:12,447 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 425 transitions. Word has length 38 [2021-10-05 21:12:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:12,447 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 425 transitions. [2021-10-05 21:12:12,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 425 transitions. [2021-10-05 21:12:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:12,448 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:12,448 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:12,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2021-10-05 21:12:12,448 INFO L402 AbstractCegarLoop]: === Iteration 284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash -59465581, now seen corresponding path program 283 times [2021-10-05 21:12:12,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:12,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927369706] [2021-10-05 21:12:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:12,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:12,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:12,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927369706] [2021-10-05 21:12:12,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927369706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:12,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:12,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:12,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983134810] [2021-10-05 21:12:12,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:12,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:12,558 INFO L87 Difference]: Start difference. First operand 206 states and 425 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:12,841 INFO L93 Difference]: Finished difference Result 322 states and 679 transitions. [2021-10-05 21:12:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:12,842 INFO L225 Difference]: With dead ends: 322 [2021-10-05 21:12:12,842 INFO L226 Difference]: Without dead ends: 306 [2021-10-05 21:12:12,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 158.0ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-05 21:12:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 212. [2021-10-05 21:12:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.132701421800948) internal successors, (450), 211 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 450 transitions. [2021-10-05 21:12:12,845 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 450 transitions. Word has length 38 [2021-10-05 21:12:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:12,846 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 450 transitions. [2021-10-05 21:12:12,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 450 transitions. [2021-10-05 21:12:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:12,846 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:12,846 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:12,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2021-10-05 21:12:12,847 INFO L402 AbstractCegarLoop]: === Iteration 285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -727953445, now seen corresponding path program 284 times [2021-10-05 21:12:12,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:12,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028353792] [2021-10-05 21:12:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:12,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:12,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:12,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028353792] [2021-10-05 21:12:12,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028353792] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:12,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:12,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:12,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041450709] [2021-10-05 21:12:12,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:12,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:12,976 INFO L87 Difference]: Start difference. First operand 212 states and 450 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:13,215 INFO L93 Difference]: Finished difference Result 242 states and 501 transitions. [2021-10-05 21:12:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:13,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:13,216 INFO L225 Difference]: With dead ends: 242 [2021-10-05 21:12:13,216 INFO L226 Difference]: Without dead ends: 226 [2021-10-05 21:12:13,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 173.1ms TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-05 21:12:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210. [2021-10-05 21:12:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.1291866028708135) internal successors, (445), 209 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 445 transitions. [2021-10-05 21:12:13,219 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 445 transitions. Word has length 38 [2021-10-05 21:12:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:13,219 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 445 transitions. [2021-10-05 21:12:13,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 445 transitions. [2021-10-05 21:12:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:13,220 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:13,220 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:13,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2021-10-05 21:12:13,220 INFO L402 AbstractCegarLoop]: === Iteration 286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1046291377, now seen corresponding path program 285 times [2021-10-05 21:12:13,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:13,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77756344] [2021-10-05 21:12:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:13,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:13,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:13,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77756344] [2021-10-05 21:12:13,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77756344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:13,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:13,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:13,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154930441] [2021-10-05 21:12:13,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:13,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:13,349 INFO L87 Difference]: Start difference. First operand 210 states and 445 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:13,607 INFO L93 Difference]: Finished difference Result 260 states and 540 transitions. [2021-10-05 21:12:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:13,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:13,608 INFO L225 Difference]: With dead ends: 260 [2021-10-05 21:12:13,608 INFO L226 Difference]: Without dead ends: 248 [2021-10-05 21:12:13,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 168.3ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-05 21:12:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 210. [2021-10-05 21:12:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.1004784688995217) internal successors, (439), 209 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 439 transitions. [2021-10-05 21:12:13,611 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 439 transitions. Word has length 38 [2021-10-05 21:12:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:13,612 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 439 transitions. [2021-10-05 21:12:13,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 439 transitions. [2021-10-05 21:12:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:13,612 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:13,612 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:13,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2021-10-05 21:12:13,613 INFO L402 AbstractCegarLoop]: === Iteration 287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:13,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1851937469, now seen corresponding path program 286 times [2021-10-05 21:12:13,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:13,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112645748] [2021-10-05 21:12:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:13,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:13,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:13,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112645748] [2021-10-05 21:12:13,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112645748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:13,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:13,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:13,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388030355] [2021-10-05 21:12:13,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:13,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:13,738 INFO L87 Difference]: Start difference. First operand 210 states and 439 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:14,061 INFO L93 Difference]: Finished difference Result 320 states and 662 transitions. [2021-10-05 21:12:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:14,063 INFO L225 Difference]: With dead ends: 320 [2021-10-05 21:12:14,063 INFO L226 Difference]: Without dead ends: 306 [2021-10-05 21:12:14,063 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 178.7ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:12:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-05 21:12:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 202. [2021-10-05 21:12:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.0945273631840795) internal successors, (421), 201 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 421 transitions. [2021-10-05 21:12:14,067 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 421 transitions. Word has length 38 [2021-10-05 21:12:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:14,067 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 421 transitions. [2021-10-05 21:12:14,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 421 transitions. [2021-10-05 21:12:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:14,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:14,068 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:14,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2021-10-05 21:12:14,068 INFO L402 AbstractCegarLoop]: === Iteration 288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1690523493, now seen corresponding path program 287 times [2021-10-05 21:12:14,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:14,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470891877] [2021-10-05 21:12:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:14,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:14,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:14,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470891877] [2021-10-05 21:12:14,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470891877] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:14,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:14,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:14,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702166773] [2021-10-05 21:12:14,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:14,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:14,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:14,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:14,195 INFO L87 Difference]: Start difference. First operand 202 states and 421 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:14,491 INFO L93 Difference]: Finished difference Result 260 states and 532 transitions. [2021-10-05 21:12:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:14,492 INFO L225 Difference]: With dead ends: 260 [2021-10-05 21:12:14,492 INFO L226 Difference]: Without dead ends: 240 [2021-10-05 21:12:14,492 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 178.8ms TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-10-05 21:12:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-05 21:12:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 208. [2021-10-05 21:12:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.077294685990338) internal successors, (430), 207 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 430 transitions. [2021-10-05 21:12:14,495 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 430 transitions. Word has length 38 [2021-10-05 21:12:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:14,495 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 430 transitions. [2021-10-05 21:12:14,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 430 transitions. [2021-10-05 21:12:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:14,496 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:14,496 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:14,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2021-10-05 21:12:14,496 INFO L402 AbstractCegarLoop]: === Iteration 289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1868223171, now seen corresponding path program 288 times [2021-10-05 21:12:14,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:14,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901976952] [2021-10-05 21:12:14,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:14,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:14,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:14,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901976952] [2021-10-05 21:12:14,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901976952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:14,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:14,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:14,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268496610] [2021-10-05 21:12:14,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:14,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:14,617 INFO L87 Difference]: Start difference. First operand 208 states and 430 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:14,955 INFO L93 Difference]: Finished difference Result 298 states and 607 transitions. [2021-10-05 21:12:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 21:12:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:14,957 INFO L225 Difference]: With dead ends: 298 [2021-10-05 21:12:14,957 INFO L226 Difference]: Without dead ends: 258 [2021-10-05 21:12:14,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 198.0ms TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:12:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-05 21:12:14,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2021-10-05 21:12:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 2.0646766169154227) internal successors, (415), 201 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 415 transitions. [2021-10-05 21:12:14,960 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 415 transitions. Word has length 38 [2021-10-05 21:12:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:14,960 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 415 transitions. [2021-10-05 21:12:14,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 415 transitions. [2021-10-05 21:12:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:14,961 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:14,961 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:14,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2021-10-05 21:12:14,961 INFO L402 AbstractCegarLoop]: === Iteration 290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:14,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1095026715, now seen corresponding path program 289 times [2021-10-05 21:12:14,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:14,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071817414] [2021-10-05 21:12:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:14,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:15,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:15,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071817414] [2021-10-05 21:12:15,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071817414] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:15,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:15,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:15,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890055944] [2021-10-05 21:12:15,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:15,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:15,077 INFO L87 Difference]: Start difference. First operand 202 states and 415 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:15,339 INFO L93 Difference]: Finished difference Result 268 states and 550 transitions. [2021-10-05 21:12:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:15,340 INFO L225 Difference]: With dead ends: 268 [2021-10-05 21:12:15,340 INFO L226 Difference]: Without dead ends: 256 [2021-10-05 21:12:15,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 164.2ms TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2021-10-05 21:12:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-10-05 21:12:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 204. [2021-10-05 21:12:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.0689655172413794) internal successors, (420), 203 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 420 transitions. [2021-10-05 21:12:15,343 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 420 transitions. Word has length 38 [2021-10-05 21:12:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:15,343 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 420 transitions. [2021-10-05 21:12:15,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 420 transitions. [2021-10-05 21:12:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:15,344 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:15,344 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:15,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2021-10-05 21:12:15,344 INFO L402 AbstractCegarLoop]: === Iteration 291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2077525135, now seen corresponding path program 290 times [2021-10-05 21:12:15,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:15,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406193147] [2021-10-05 21:12:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:15,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:15,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:15,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406193147] [2021-10-05 21:12:15,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406193147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:15,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:15,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:15,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73593101] [2021-10-05 21:12:15,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:15,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:15,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:15,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:15,464 INFO L87 Difference]: Start difference. First operand 204 states and 420 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:15,767 INFO L93 Difference]: Finished difference Result 276 states and 560 transitions. [2021-10-05 21:12:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 21:12:15,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:15,769 INFO L225 Difference]: With dead ends: 276 [2021-10-05 21:12:15,769 INFO L226 Difference]: Without dead ends: 254 [2021-10-05 21:12:15,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 195.3ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:12:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-05 21:12:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2021-10-05 21:12:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.0591133004926108) internal successors, (418), 203 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 418 transitions. [2021-10-05 21:12:15,773 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 418 transitions. Word has length 38 [2021-10-05 21:12:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:15,773 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 418 transitions. [2021-10-05 21:12:15,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 418 transitions. [2021-10-05 21:12:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:15,774 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:15,774 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:15,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2021-10-05 21:12:15,774 INFO L402 AbstractCegarLoop]: === Iteration 292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -327899983, now seen corresponding path program 291 times [2021-10-05 21:12:15,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:15,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264640041] [2021-10-05 21:12:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:15,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:15,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:15,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264640041] [2021-10-05 21:12:15,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264640041] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:15,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:15,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:15,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835926925] [2021-10-05 21:12:15,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:15,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:15,880 INFO L87 Difference]: Start difference. First operand 204 states and 418 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:16,098 INFO L93 Difference]: Finished difference Result 258 states and 527 transitions. [2021-10-05 21:12:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:16,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:16,099 INFO L225 Difference]: With dead ends: 258 [2021-10-05 21:12:16,099 INFO L226 Difference]: Without dead ends: 250 [2021-10-05 21:12:16,099 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 127.5ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:12:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-10-05 21:12:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 204. [2021-10-05 21:12:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.0492610837438425) internal successors, (416), 203 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 416 transitions. [2021-10-05 21:12:16,102 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 416 transitions. Word has length 38 [2021-10-05 21:12:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:16,103 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 416 transitions. [2021-10-05 21:12:16,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 416 transitions. [2021-10-05 21:12:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:16,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:16,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:16,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2021-10-05 21:12:16,104 INFO L402 AbstractCegarLoop]: === Iteration 293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash -153145701, now seen corresponding path program 292 times [2021-10-05 21:12:16,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:16,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869858424] [2021-10-05 21:12:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:16,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:16,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:16,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869858424] [2021-10-05 21:12:16,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869858424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:16,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:16,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:16,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510056688] [2021-10-05 21:12:16,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:16,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:16,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:16,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:16,214 INFO L87 Difference]: Start difference. First operand 204 states and 416 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:16,447 INFO L93 Difference]: Finished difference Result 254 states and 513 transitions. [2021-10-05 21:12:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:16,449 INFO L225 Difference]: With dead ends: 254 [2021-10-05 21:12:16,449 INFO L226 Difference]: Without dead ends: 226 [2021-10-05 21:12:16,449 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 146.9ms TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-05 21:12:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2021-10-05 21:12:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.05699481865285) internal successors, (397), 193 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 397 transitions. [2021-10-05 21:12:16,452 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 397 transitions. Word has length 38 [2021-10-05 21:12:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:16,452 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 397 transitions. [2021-10-05 21:12:16,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 397 transitions. [2021-10-05 21:12:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:16,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:16,453 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:16,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2021-10-05 21:12:16,453 INFO L402 AbstractCegarLoop]: === Iteration 294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 330131505, now seen corresponding path program 293 times [2021-10-05 21:12:16,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:16,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080773321] [2021-10-05 21:12:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:16,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:16,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:16,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080773321] [2021-10-05 21:12:16,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080773321] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:16,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:16,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:16,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731197568] [2021-10-05 21:12:16,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:16,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:16,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:16,562 INFO L87 Difference]: Start difference. First operand 194 states and 397 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:16,762 INFO L93 Difference]: Finished difference Result 214 states and 429 transitions. [2021-10-05 21:12:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:16,763 INFO L225 Difference]: With dead ends: 214 [2021-10-05 21:12:16,763 INFO L226 Difference]: Without dead ends: 192 [2021-10-05 21:12:16,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 130.2ms TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-05 21:12:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-10-05 21:12:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.0523560209424083) internal successors, (392), 191 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 392 transitions. [2021-10-05 21:12:16,767 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 392 transitions. Word has length 38 [2021-10-05 21:12:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:16,767 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 392 transitions. [2021-10-05 21:12:16,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 392 transitions. [2021-10-05 21:12:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:16,768 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:16,768 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:16,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2021-10-05 21:12:16,768 INFO L402 AbstractCegarLoop]: === Iteration 295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash -102601993, now seen corresponding path program 294 times [2021-10-05 21:12:16,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:16,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196210084] [2021-10-05 21:12:16,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:16,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:16,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:16,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196210084] [2021-10-05 21:12:16,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196210084] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:16,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:16,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:16,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731116322] [2021-10-05 21:12:16,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:16,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:16,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:16,891 INFO L87 Difference]: Start difference. First operand 192 states and 392 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:17,090 INFO L93 Difference]: Finished difference Result 222 states and 447 transitions. [2021-10-05 21:12:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:17,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:17,092 INFO L225 Difference]: With dead ends: 222 [2021-10-05 21:12:17,092 INFO L226 Difference]: Without dead ends: 202 [2021-10-05 21:12:17,092 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 144.8ms TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-05 21:12:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2021-10-05 21:12:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.035532994923858) internal successors, (401), 197 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 401 transitions. [2021-10-05 21:12:17,095 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 401 transitions. Word has length 38 [2021-10-05 21:12:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:17,095 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 401 transitions. [2021-10-05 21:12:17,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 401 transitions. [2021-10-05 21:12:17,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:17,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:17,096 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:17,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2021-10-05 21:12:17,096 INFO L402 AbstractCegarLoop]: === Iteration 296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:17,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:17,096 INFO L82 PathProgramCache]: Analyzing trace with hash -838822625, now seen corresponding path program 295 times [2021-10-05 21:12:17,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:17,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464775391] [2021-10-05 21:12:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:17,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:17,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:17,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464775391] [2021-10-05 21:12:17,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464775391] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:17,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:17,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:17,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933765400] [2021-10-05 21:12:17,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:17,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:17,222 INFO L87 Difference]: Start difference. First operand 198 states and 401 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:17,422 INFO L93 Difference]: Finished difference Result 214 states and 429 transitions. [2021-10-05 21:12:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:17,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:17,423 INFO L225 Difference]: With dead ends: 214 [2021-10-05 21:12:17,423 INFO L226 Difference]: Without dead ends: 200 [2021-10-05 21:12:17,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 155.4ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-05 21:12:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-10-05 21:12:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.030150753768844) internal successors, (404), 199 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-10-05 21:12:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 404 transitions. [2021-10-05 21:12:17,427 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 404 transitions. Word has length 38 [2021-10-05 21:12:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:17,427 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 404 transitions. [2021-10-05 21:12:17,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 404 transitions. [2021-10-05 21:12:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:17,427 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:17,427 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:17,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2021-10-05 21:12:17,428 INFO L402 AbstractCegarLoop]: === Iteration 297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:17,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:17,428 INFO L82 PathProgramCache]: Analyzing trace with hash 598566995, now seen corresponding path program 296 times [2021-10-05 21:12:17,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:17,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795923661] [2021-10-05 21:12:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:17,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:17,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:17,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795923661] [2021-10-05 21:12:17,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795923661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:17,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:17,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:17,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251773662] [2021-10-05 21:12:17,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:17,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:17,546 INFO L87 Difference]: Start difference. First operand 200 states and 404 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:17,738 INFO L93 Difference]: Finished difference Result 218 states and 437 transitions. [2021-10-05 21:12:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:17,738 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:17,739 INFO L225 Difference]: With dead ends: 218 [2021-10-05 21:12:17,739 INFO L226 Difference]: Without dead ends: 188 [2021-10-05 21:12:17,739 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 143.1ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-10-05 21:12:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-10-05 21:12:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.053475935828877) internal successors, (384), 187 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 384 transitions. [2021-10-05 21:12:17,742 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 384 transitions. Word has length 38 [2021-10-05 21:12:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:17,742 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 384 transitions. [2021-10-05 21:12:17,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 384 transitions. [2021-10-05 21:12:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:17,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:17,742 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:17,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-10-05 21:12:17,743 INFO L402 AbstractCegarLoop]: === Iteration 298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash 766419323, now seen corresponding path program 297 times [2021-10-05 21:12:17,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:17,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020495531] [2021-10-05 21:12:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:17,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:17,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:17,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020495531] [2021-10-05 21:12:17,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020495531] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:17,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:17,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:17,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476169533] [2021-10-05 21:12:17,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:17,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:17,837 INFO L87 Difference]: Start difference. First operand 188 states and 384 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:18,030 INFO L93 Difference]: Finished difference Result 210 states and 415 transitions. [2021-10-05 21:12:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:18,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:18,032 INFO L225 Difference]: With dead ends: 210 [2021-10-05 21:12:18,032 INFO L226 Difference]: Without dead ends: 198 [2021-10-05 21:12:18,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:12:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-05 21:12:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2021-10-05 21:12:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.021390374331551) internal successors, (378), 187 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 378 transitions. [2021-10-05 21:12:18,034 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 378 transitions. Word has length 38 [2021-10-05 21:12:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:18,034 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 378 transitions. [2021-10-05 21:12:18,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 378 transitions. [2021-10-05 21:12:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:18,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:18,035 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:18,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2021-10-05 21:12:18,035 INFO L402 AbstractCegarLoop]: === Iteration 299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1116003789, now seen corresponding path program 298 times [2021-10-05 21:12:18,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:18,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248534999] [2021-10-05 21:12:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:18,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:18,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:18,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248534999] [2021-10-05 21:12:18,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248534999] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:18,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:18,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:18,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471584103] [2021-10-05 21:12:18,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:18,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:18,133 INFO L87 Difference]: Start difference. First operand 188 states and 378 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:18,346 INFO L93 Difference]: Finished difference Result 256 states and 520 transitions. [2021-10-05 21:12:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:12:18,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:18,347 INFO L225 Difference]: With dead ends: 256 [2021-10-05 21:12:18,347 INFO L226 Difference]: Without dead ends: 248 [2021-10-05 21:12:18,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 91.0ms TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:12:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-10-05 21:12:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 190. [2021-10-05 21:12:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.015873015873016) internal successors, (381), 189 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 381 transitions. [2021-10-05 21:12:18,351 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 381 transitions. Word has length 38 [2021-10-05 21:12:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:18,351 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 381 transitions. [2021-10-05 21:12:18,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 381 transitions. [2021-10-05 21:12:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:18,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:18,352 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:18,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2021-10-05 21:12:18,352 INFO L402 AbstractCegarLoop]: === Iteration 300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash -394832861, now seen corresponding path program 299 times [2021-10-05 21:12:18,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:18,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921086765] [2021-10-05 21:12:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:18,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:18,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:18,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921086765] [2021-10-05 21:12:18,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921086765] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:18,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:18,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:18,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86351455] [2021-10-05 21:12:18,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:18,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:18,457 INFO L87 Difference]: Start difference. First operand 190 states and 381 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:18,686 INFO L93 Difference]: Finished difference Result 254 states and 513 transitions. [2021-10-05 21:12:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:18,688 INFO L225 Difference]: With dead ends: 254 [2021-10-05 21:12:18,688 INFO L226 Difference]: Without dead ends: 240 [2021-10-05 21:12:18,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-05 21:12:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 182. [2021-10-05 21:12:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.005524861878453) internal successors, (363), 181 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 363 transitions. [2021-10-05 21:12:18,691 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 363 transitions. Word has length 38 [2021-10-05 21:12:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:18,692 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 363 transitions. [2021-10-05 21:12:18,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 363 transitions. [2021-10-05 21:12:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:18,692 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:18,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2021-10-05 21:12:18,692 INFO L402 AbstractCegarLoop]: === Iteration 301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2051568799, now seen corresponding path program 300 times [2021-10-05 21:12:18,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:18,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104135443] [2021-10-05 21:12:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:18,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:18,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:18,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104135443] [2021-10-05 21:12:18,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104135443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:18,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:18,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:18,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728571209] [2021-10-05 21:12:18,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:18,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:18,805 INFO L87 Difference]: Start difference. First operand 182 states and 363 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:19,017 INFO L93 Difference]: Finished difference Result 198 states and 389 transitions. [2021-10-05 21:12:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:19,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:19,018 INFO L225 Difference]: With dead ends: 198 [2021-10-05 21:12:19,019 INFO L226 Difference]: Without dead ends: 178 [2021-10-05 21:12:19,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 104.7ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-10-05 21:12:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2021-10-05 21:12:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.9885714285714287) internal successors, (348), 175 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 348 transitions. [2021-10-05 21:12:19,021 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 348 transitions. Word has length 38 [2021-10-05 21:12:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:19,021 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 348 transitions. [2021-10-05 21:12:19,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 348 transitions. [2021-10-05 21:12:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:19,022 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:19,022 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:19,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2021-10-05 21:12:19,022 INFO L402 AbstractCegarLoop]: === Iteration 302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:19,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1166631645, now seen corresponding path program 301 times [2021-10-05 21:12:19,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:19,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052428453] [2021-10-05 21:12:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:19,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:19,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:19,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052428453] [2021-10-05 21:12:19,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052428453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:19,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:19,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:19,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247804237] [2021-10-05 21:12:19,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:19,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:19,130 INFO L87 Difference]: Start difference. First operand 176 states and 348 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:19,350 INFO L93 Difference]: Finished difference Result 222 states and 441 transitions. [2021-10-05 21:12:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:19,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:19,351 INFO L225 Difference]: With dead ends: 222 [2021-10-05 21:12:19,352 INFO L226 Difference]: Without dead ends: 204 [2021-10-05 21:12:19,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 114.1ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:12:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-10-05 21:12:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2021-10-05 21:12:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.9830508474576272) internal successors, (351), 177 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 351 transitions. [2021-10-05 21:12:19,354 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 351 transitions. Word has length 38 [2021-10-05 21:12:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:19,354 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 351 transitions. [2021-10-05 21:12:19,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 351 transitions. [2021-10-05 21:12:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:19,355 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:19,355 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:19,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2021-10-05 21:12:19,355 INFO L402 AbstractCegarLoop]: === Iteration 303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:19,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 420629283, now seen corresponding path program 302 times [2021-10-05 21:12:19,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:19,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717471578] [2021-10-05 21:12:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:19,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:19,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:19,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717471578] [2021-10-05 21:12:19,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717471578] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:19,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:19,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:19,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759054517] [2021-10-05 21:12:19,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:19,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:19,474 INFO L87 Difference]: Start difference. First operand 178 states and 351 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:19,707 INFO L93 Difference]: Finished difference Result 192 states and 374 transitions. [2021-10-05 21:12:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:19,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:19,708 INFO L225 Difference]: With dead ends: 192 [2021-10-05 21:12:19,708 INFO L226 Difference]: Without dead ends: 170 [2021-10-05 21:12:19,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 134.8ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-10-05 21:12:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2021-10-05 21:12:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.970414201183432) internal successors, (333), 169 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 333 transitions. [2021-10-05 21:12:19,711 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 333 transitions. Word has length 38 [2021-10-05 21:12:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:19,711 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 333 transitions. [2021-10-05 21:12:19,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 333 transitions. [2021-10-05 21:12:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:19,712 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:19,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:19,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2021-10-05 21:12:19,712 INFO L402 AbstractCegarLoop]: === Iteration 304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash -135521233, now seen corresponding path program 303 times [2021-10-05 21:12:19,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:19,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234357686] [2021-10-05 21:12:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:19,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:19,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:19,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234357686] [2021-10-05 21:12:19,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234357686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:19,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:19,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:19,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778626928] [2021-10-05 21:12:19,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:19,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:19,812 INFO L87 Difference]: Start difference. First operand 170 states and 333 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:19,979 INFO L93 Difference]: Finished difference Result 174 states and 337 transitions. [2021-10-05 21:12:19,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:12:19,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:19,980 INFO L225 Difference]: With dead ends: 174 [2021-10-05 21:12:19,980 INFO L226 Difference]: Without dead ends: 166 [2021-10-05 21:12:19,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 103.8ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:12:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-05 21:12:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-10-05 21:12:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.9575757575757575) internal successors, (323), 165 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 323 transitions. [2021-10-05 21:12:19,983 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 323 transitions. Word has length 38 [2021-10-05 21:12:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:19,983 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 323 transitions. [2021-10-05 21:12:19,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 323 transitions. [2021-10-05 21:12:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:19,984 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:19,984 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:19,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2021-10-05 21:12:19,984 INFO L402 AbstractCegarLoop]: === Iteration 305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash 585649695, now seen corresponding path program 304 times [2021-10-05 21:12:19,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:19,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497625995] [2021-10-05 21:12:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:19,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:20,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:20,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497625995] [2021-10-05 21:12:20,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497625995] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:20,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:20,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:20,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897107247] [2021-10-05 21:12:20,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:20,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:20,090 INFO L87 Difference]: Start difference. First operand 166 states and 323 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:20,281 INFO L93 Difference]: Finished difference Result 172 states and 330 transitions. [2021-10-05 21:12:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:20,282 INFO L225 Difference]: With dead ends: 172 [2021-10-05 21:12:20,282 INFO L226 Difference]: Without dead ends: 164 [2021-10-05 21:12:20,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 125.2ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-05 21:12:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-10-05 21:12:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.950920245398773) internal successors, (318), 163 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 318 transitions. [2021-10-05 21:12:20,286 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 318 transitions. Word has length 38 [2021-10-05 21:12:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:20,286 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 318 transitions. [2021-10-05 21:12:20,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 318 transitions. [2021-10-05 21:12:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:20,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:20,286 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:20,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2021-10-05 21:12:20,287 INFO L402 AbstractCegarLoop]: === Iteration 306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash -472447691, now seen corresponding path program 305 times [2021-10-05 21:12:20,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:20,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212049603] [2021-10-05 21:12:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:20,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:20,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:20,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212049603] [2021-10-05 21:12:20,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212049603] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:20,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:20,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:20,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792462285] [2021-10-05 21:12:20,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:20,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:20,396 INFO L87 Difference]: Start difference. First operand 164 states and 318 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:20,583 INFO L93 Difference]: Finished difference Result 176 states and 338 transitions. [2021-10-05 21:12:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:20,585 INFO L225 Difference]: With dead ends: 176 [2021-10-05 21:12:20,585 INFO L226 Difference]: Without dead ends: 158 [2021-10-05 21:12:20,585 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 120.9ms TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-05 21:12:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-10-05 21:12:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.929936305732484) internal successors, (303), 157 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 303 transitions. [2021-10-05 21:12:20,587 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 303 transitions. Word has length 38 [2021-10-05 21:12:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:20,587 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 303 transitions. [2021-10-05 21:12:20,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 303 transitions. [2021-10-05 21:12:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:20,588 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:20,588 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:20,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2021-10-05 21:12:20,588 INFO L402 AbstractCegarLoop]: === Iteration 307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1218450053, now seen corresponding path program 306 times [2021-10-05 21:12:20,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:20,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417182017] [2021-10-05 21:12:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:20,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:20,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:20,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417182017] [2021-10-05 21:12:20,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417182017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:20,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:20,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:20,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597504536] [2021-10-05 21:12:20,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:20,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:20,698 INFO L87 Difference]: Start difference. First operand 158 states and 303 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:20,882 INFO L93 Difference]: Finished difference Result 138 states and 257 transitions. [2021-10-05 21:12:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:20,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:20,883 INFO L225 Difference]: With dead ends: 138 [2021-10-05 21:12:20,883 INFO L226 Difference]: Without dead ends: 114 [2021-10-05 21:12:20,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 118.0ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-05 21:12:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-05 21:12:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.920353982300885) internal successors, (217), 113 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 217 transitions. [2021-10-05 21:12:20,885 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 217 transitions. Word has length 38 [2021-10-05 21:12:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:20,885 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 217 transitions. [2021-10-05 21:12:20,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 217 transitions. [2021-10-05 21:12:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:20,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:20,886 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:20,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2021-10-05 21:12:20,886 INFO L402 AbstractCegarLoop]: === Iteration 308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:20,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1438397617, now seen corresponding path program 307 times [2021-10-05 21:12:20,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:20,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493682868] [2021-10-05 21:12:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:20,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:20,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:20,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493682868] [2021-10-05 21:12:20,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493682868] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:20,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:20,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:20,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824547204] [2021-10-05 21:12:20,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:20,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:20,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:20,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:20,982 INFO L87 Difference]: Start difference. First operand 114 states and 217 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:21,150 INFO L93 Difference]: Finished difference Result 128 states and 236 transitions. [2021-10-05 21:12:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:21,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:21,151 INFO L225 Difference]: With dead ends: 128 [2021-10-05 21:12:21,151 INFO L226 Difference]: Without dead ends: 116 [2021-10-05 21:12:21,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 90.3ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:12:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-05 21:12:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2021-10-05 21:12:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.8672566371681416) internal successors, (211), 113 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 211 transitions. [2021-10-05 21:12:21,154 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 211 transitions. Word has length 38 [2021-10-05 21:12:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:21,154 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 211 transitions. [2021-10-05 21:12:21,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 211 transitions. [2021-10-05 21:12:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:21,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:21,155 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:21,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2021-10-05 21:12:21,155 INFO L402 AbstractCegarLoop]: === Iteration 309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1459831229, now seen corresponding path program 308 times [2021-10-05 21:12:21,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:21,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134522646] [2021-10-05 21:12:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:21,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:21,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:21,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134522646] [2021-10-05 21:12:21,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134522646] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:21,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:21,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:21,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125754325] [2021-10-05 21:12:21,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:21,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:21,247 INFO L87 Difference]: Start difference. First operand 114 states and 211 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:21,456 INFO L93 Difference]: Finished difference Result 188 states and 360 transitions. [2021-10-05 21:12:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:21,457 INFO L225 Difference]: With dead ends: 188 [2021-10-05 21:12:21,457 INFO L226 Difference]: Without dead ends: 166 [2021-10-05 21:12:21,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 101.9ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:12:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-05 21:12:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 108. [2021-10-05 21:12:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.8317757009345794) internal successors, (196), 107 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2021-10-05 21:12:21,459 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 38 [2021-10-05 21:12:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:21,459 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2021-10-05 21:12:21,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2021-10-05 21:12:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:21,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:21,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:21,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2021-10-05 21:12:21,460 INFO L402 AbstractCegarLoop]: === Iteration 310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:21,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1298417253, now seen corresponding path program 309 times [2021-10-05 21:12:21,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:21,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544694312] [2021-10-05 21:12:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:21,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:21,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:21,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544694312] [2021-10-05 21:12:21,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544694312] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:21,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:21,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 21:12:21,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995089752] [2021-10-05 21:12:21,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 21:12:21,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:21,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 21:12:21,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-05 21:12:21,579 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:21,742 INFO L93 Difference]: Finished difference Result 124 states and 222 transitions. [2021-10-05 21:12:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 21:12:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:21,743 INFO L225 Difference]: With dead ends: 124 [2021-10-05 21:12:21,743 INFO L226 Difference]: Without dead ends: 104 [2021-10-05 21:12:21,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 121.9ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-05 21:12:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2021-10-05 21:12:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.7920792079207921) internal successors, (181), 101 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 181 transitions. [2021-10-05 21:12:21,744 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 181 transitions. Word has length 38 [2021-10-05 21:12:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:21,745 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 181 transitions. [2021-10-05 21:12:21,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 181 transitions. [2021-10-05 21:12:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:21,745 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:21,745 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:21,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2021-10-05 21:12:21,745 INFO L402 AbstractCegarLoop]: === Iteration 311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:21,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2034637885, now seen corresponding path program 310 times [2021-10-05 21:12:21,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:21,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200802172] [2021-10-05 21:12:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:21,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:21,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:21,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200802172] [2021-10-05 21:12:21,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200802172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:21,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:21,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:21,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572519100] [2021-10-05 21:12:21,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:21,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:21,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:21,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:21,848 INFO L87 Difference]: Start difference. First operand 102 states and 181 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:22,047 INFO L93 Difference]: Finished difference Result 136 states and 242 transitions. [2021-10-05 21:12:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 21:12:22,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:22,048 INFO L225 Difference]: With dead ends: 136 [2021-10-05 21:12:22,048 INFO L226 Difference]: Without dead ends: 96 [2021-10-05 21:12:22,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 122.0ms TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2021-10-05 21:12:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-10-05 21:12:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-10-05 21:12:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.7473684210526317) internal successors, (166), 95 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 166 transitions. [2021-10-05 21:12:22,051 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 166 transitions. Word has length 38 [2021-10-05 21:12:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:22,051 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 166 transitions. [2021-10-05 21:12:22,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 166 transitions. [2021-10-05 21:12:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:22,052 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:22,052 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:22,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2021-10-05 21:12:22,052 INFO L402 AbstractCegarLoop]: === Iteration 312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1487132955, now seen corresponding path program 311 times [2021-10-05 21:12:22,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:22,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488528613] [2021-10-05 21:12:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:22,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:22,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:22,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488528613] [2021-10-05 21:12:22,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488528613] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:22,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:22,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 21:12:22,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743236345] [2021-10-05 21:12:22,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:12:22,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:12:22,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:12:22,144 INFO L87 Difference]: Start difference. First operand 96 states and 166 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:22,298 INFO L93 Difference]: Finished difference Result 102 states and 173 transitions. [2021-10-05 21:12:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:22,299 INFO L225 Difference]: With dead ends: 102 [2021-10-05 21:12:22,299 INFO L226 Difference]: Without dead ends: 90 [2021-10-05 21:12:22,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:12:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-05 21:12:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-10-05 21:12:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.696629213483146) internal successors, (151), 89 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 151 transitions. [2021-10-05 21:12:22,300 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 151 transitions. Word has length 38 [2021-10-05 21:12:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:22,300 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 151 transitions. [2021-10-05 21:12:22,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 151 transitions. [2021-10-05 21:12:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-05 21:12:22,301 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:12:22,301 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:12:22,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-10-05 21:12:22,301 INFO L402 AbstractCegarLoop]: === Iteration 313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-10-05 21:12:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:12:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1685418895, now seen corresponding path program 312 times [2021-10-05 21:12:22,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:12:22,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962536769] [2021-10-05 21:12:22,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:12:22,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:12:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:12:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:12:22,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:12:22,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962536769] [2021-10-05 21:12:22,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962536769] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:12:22,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:12:22,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 21:12:22,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936651092] [2021-10-05 21:12:22,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 21:12:22,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:12:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 21:12:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:12:22,399 INFO L87 Difference]: Start difference. First operand 90 states and 151 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:12:22,547 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2021-10-05 21:12:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:12:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-05 21:12:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:12:22,548 INFO L225 Difference]: With dead ends: 50 [2021-10-05 21:12:22,548 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 21:12:22,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 106.6ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-10-05 21:12:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 21:12:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 21:12:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 21:12:22,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2021-10-05 21:12:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:12:22,549 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 21:12:22,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 21:12:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 21:12:22,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 21:12:22,552 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 21:12:22,554 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 21:12:22,554 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 21:12:22,555 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 21:12:22,555 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-05 21:12:22,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-10-05 21:12:22,561 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 21:12:22,562 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 21:12:22,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 09:12:22 BasicIcfg [2021-10-05 21:12:22,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 21:12:22,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 21:12:22,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 21:12:22,566 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 21:12:22,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:08:56" (3/4) ... [2021-10-05 21:12:22,570 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 21:12:22,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 21:12:22,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 21:12:22,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 21:12:22,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2021-10-05 21:12:22,583 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-10-05 21:12:22,584 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 21:12:22,584 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 21:12:22,584 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 21:12:22,629 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 21:12:22,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 21:12:22,635 INFO L168 Benchmark]: Toolchain (without parser) took 207450.10 ms. Allocated memory was 52.4 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 29.3 MB in the beginning and 656.2 MB in the end (delta: -626.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-05 21:12:22,636 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 39.8 MB. Free memory was 23.2 MB in the beginning and 23.2 MB in the end (delta: 27.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:12:22,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.30 ms. Allocated memory is still 52.4 MB. Free memory was 29.0 MB in the beginning and 31.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2021-10-05 21:12:22,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.64 ms. Allocated memory is still 52.4 MB. Free memory was 31.5 MB in the beginning and 29.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:12:22,640 INFO L168 Benchmark]: Boogie Preprocessor took 64.40 ms. Allocated memory is still 52.4 MB. Free memory was 29.4 MB in the beginning and 28.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:12:22,642 INFO L168 Benchmark]: RCFGBuilder took 631.08 ms. Allocated memory is still 52.4 MB. Free memory was 28.2 MB in the beginning and 26.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-05 21:12:22,643 INFO L168 Benchmark]: TraceAbstraction took 206202.10 ms. Allocated memory was 52.4 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 26.2 MB in the beginning and 660.4 MB in the end (delta: -634.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-05 21:12:22,643 INFO L168 Benchmark]: Witness Printer took 67.29 ms. Allocated memory is still 1.8 GB. Free memory was 660.4 MB in the beginning and 656.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:12:22,646 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.31 ms. Allocated memory is still 39.8 MB. Free memory was 23.2 MB in the beginning and 23.2 MB in the end (delta: 27.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 375.30 ms. Allocated memory is still 52.4 MB. Free memory was 29.0 MB in the beginning and 31.5 MB in the end (delta: -2.5 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 93.64 ms. Allocated memory is still 52.4 MB. Free memory was 31.5 MB in the beginning and 29.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.40 ms. Allocated memory is still 52.4 MB. Free memory was 29.4 MB in the beginning and 28.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 631.08 ms. Allocated memory is still 52.4 MB. Free memory was 28.2 MB in the beginning and 26.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 206202.10 ms. Allocated memory was 52.4 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 26.2 MB in the beginning and 660.4 MB in the end (delta: -634.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 67.29 ms. Allocated memory is still 1.8 GB. Free memory was 660.4 MB in the beginning and 656.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6048.7ms, 166 PlacesBefore, 56 PlacesAfterwards, 159 TransitionsBefore, 47 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 142 TotalNumberOfCompositions, 11383 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6493, positive: 6243, positive conditional: 0, positive unconditional: 6243, negative: 250, negative conditional: 0, negative unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3059, positive: 2997, positive conditional: 0, positive unconditional: 2997, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3059, positive: 2870, positive conditional: 0, positive unconditional: 2870, negative: 189, negative conditional: 0, negative unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 189, positive: 127, positive conditional: 0, positive unconditional: 127, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6493, positive: 3246, positive conditional: 0, positive unconditional: 3246, negative: 188, negative conditional: 0, negative unconditional: 188, unknown: 3059, unknown conditional: 0, unknown unconditional: 3059] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - 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: 120]: 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 9 procedures, 211 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 205927.3ms, OverallIterations: 313, TraceHistogramMax: 1, EmptinessCheckTime: 1225.0ms, AutomataDifference: 145634.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6347.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22455 SDtfs, 31999 SDslu, 131086 SDs, 0 SdLazy, 135918 SolverSat, 9542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70660.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7061 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 6684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30136 ImplicationChecksByTransitivity, 63982.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5742occurred in iteration=5, InterpolantAutomatonStates: 6076, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 13499.9ms AutomataMinimizationTime, 313 MinimizatonAttempts, 117528 StatesRemovedByMinimization, 285 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 503.5ms SsaConstructionTime, 5406.5ms SatisfiabilityAnalysisTime, 30986.3ms InterpolantComputationTime, 11877 NumberOfCodeBlocks, 11877 NumberOfCodeBlocksAsserted, 313 NumberOfCheckSat, 11564 ConstructedInterpolants, 0 QuantifiedInterpolants, 50720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 313 InterpolantComputations, 313 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 21:12:22,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...